Graph Algorithm Playground
Graphs are the data structure of connection, and the classic algorithms each explore them with a different personality. In this playground you build a graph by clicking to add nodes and dragging between them to add weighted edges — or start from a random one — then set an algorithm loose: breadth-first search ripples outward level by level, depth-first search dives deep, Dijkstra grows a shortest-path tree in order of distance, and Prim assembles the minimum spanning tree. Every visited node, frontier edge and final tree is animated step by step.
Runs 100% in your browser — simulations are computed locally on your device.
Read the full guide to this tool
Notes
- BFS visits nodes in order of hop count — it finds shortest paths when every edge counts 1.
- Dijkstra generalises BFS to weighted edges by always expanding the closest unvisited node.
- Prim’s minimum spanning tree and Dijkstra’s shortest-path tree look similar but optimise different things — compare them on the same graph.
- Runs 100% in your browser — simulations are computed locally on your device.
Related tools
Dynamic Programming Visualizer
Watch edit distance and knapsack fill their tables cell by cell — dynamic programming with the lid off.
Huffman Coding Visualizer
Type any text and watch the optimal prefix code assemble itself as a tree, rare letters sinking deepest.
Pathfinding Visualizer
Draw walls and watch A*, Dijkstra, greedy and breadth-first search hunt for the shortest path.
Sorting Algorithm Visualizer
Watch bubble, insertion, merge, quick and heap sort race through the same shuffled bars.
Turing Machine Simulator
Watch a Turing machine read, write and shuffle along its tape — computation stripped to its atoms.
Hamming Code Playground
Flip any bit of a Hamming-encoded message and watch the parity checks point straight at the culprit.