Algorithm visualizer

See every step, with your own input

Pick an algorithm, enter your own numbers or use a preset, then step through the run. The pseudocode and the explanation follow each step.

Arrays and searching

Sorting

Stacks, queues and Fenwick tree

Trees and tries

Graphs

Dynamic programming

Greedy and backtracking

Kruskal's minimum spanning tree

Sort the edges lightest first and keep each edge that joins two different components. Skipping the rest avoids cycles.

Precondition: The graph must be undirected.

Change one weight so the lightest edge is no longer taken. Which edge replaces it in the tree?

Step 1 of 16

Total weight so far0

Sort the edges from lightest to heaviest. Each node starts in its own component.

Speed

Labels under values name their role, such as lo, hi, mid, i, j, min, L and R. Faded items are already ruled out or already in place.

Kruskal's minimum spanning tree

Sort the edges lightest first and keep each edge that joins two different components. Skipping the rest avoids cycles.

Precondition: The graph must be undirected.