GRAPH SEARCH
Breadth-first search
Depth-first search
Topological sort (DFS)
Lecture graph (undirected)
Task DAG (directed)
Task DAG with a cycle
Custom
restart from unvisited vertices
Edit graph
Reset
← Back
Step →
Play
EDGES (A-B undirected, A->B directed, separated by commas or spaces)
Apply
Vertices are laid out on a circle; drag them to rearrange.
CODE