Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Dijkstra's algorithm

Finds the shortest route from one starting vertex to every other vertex in a graph with non-negative edge weights, always settling the closest unvisited vertex next.

Dijkstra's algorithm repeatedly selects the unvisited vertex with smallest tentative distance and relaxes its outgoing edges; correct whenever all edge weights are non-negative.

Read the full section →
Graph settings

Calculator