Graph Algorithm Visualizer
Select an algorithm below to explore interactive visualizations of fundamental graph traversal and minimum spanning tree algorithms.
Breadth-First Search
Level-order graph traversal exploring nodes by distance
Depth-First Search
Deep exploration traversal going as far as possible
Prim's Algorithm
Greedy MST algorithm growing tree from a vertex
Kruskal's Algorithm
Edge-based MST using union-find data structure