Dijkstra's algorithm is an efficient single-source shortest path algorithm. As opposed to breadth-first search, it efficiently solves the single-source shortest path problem for weighted graphs (graph with weighted edges). For the algorithm to work, all edge weights must be non negative.
Part of course:
Dijkstra's algorithm (Shortest path algorithm)
- Video with Step-by-Step Example
- Algorithm steps
- Why does the algorithm work?
- Run-time analysis
- Further reading