← ~/visualizations

dijkstra's-algorithm #

Weighted graph with nodes being visited in Dijkstra order. Shortest distances shown inside each node.

canvasclick to interact

⏮◀◀▶▶STEP0.25x1xZOOM

t=0s

practical uses #

• 01.Teaching shortest path algorithms
• 02.Explaining priority queue usage
• 03.Visualizing greedy algorithms
• 04.Demonstrating network routing

technical notes #

5-node weighted graph. Distance labels inside nodes. Visited nodes change color. Edge weights displayed.

← binary-searchattention-mechanism →