Graph Explorer

Load Graph

Sample graphs are generated randomly each time. For best performance, graphs under ~1000 nodes render smoothly.

Graph type: Undirected Directed

No graph loaded. Drag to pan, scroll to zoom.

Select two vertices and run an algorithm to find the shortest path between them.

Source vertex

Target vertex

Run DFS from a starting node. Produces a tree of all reachable nodes with parent and descendant relationships.

Start node