Choose a graph algorithm:
— Please choose a graph algorithm —
Depth-first-search
Breadth-first-search
Floyd-Warshall-search
Dijkstra's algorithm
Prim's MST
Choose a graph
Simple graph
Simple graph 2
Cyclic graph
aCyclic graph
DAG
Weakly connected graph
Strongly connected graph
Eulerian graph
Hamiltonian graph
Chordal graph
Tree graph
Start:
Pick starting node:
⏮︎
⏪︎
Run
⏩︎
⏭︎
Speed:
Slowest
Slow
Fast
Fastest
Node size:
Tiny
Small
Medium
Large
Huge
Reset pan and zoom