GraphsEvidence Contributing
Dijkstra's Shortest Path
Priority-queue-driven shortest path on a weighted graph with non-negative edges, greedily finalizing the closest node.
Practice Problems: 1
Difficulty: 0 Easy·1 Medium·0 Hard
Core technique
Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.
- Core Strategy: Priority-queue-driven shortest path on a weighted graph with non-negative edges, greedily finalizing the closest node.