← Back to Grade 10 Lessons

Dijkstra's Algorithm

Shortest paths on weighted graphs using a min-heap priority queue

Interactive Dijkstra's Animation

Watch the priority queue and distance table update step by step

Dijkstra Exercise0/2
1

BFS Shortest Path

Use BFS to find the shortest path (fewest edges) between two nodes in an unweighted graph.

2

Dijkstra's Shortest Path

Implement Dijkstra's algorithm using a min-heap to find shortest distances from a source node.