📘
📘
📘
📘
Notes
Fundamental Algorithms
Search
⌃K
Links

Shortest Paths

Dijkastra

Shortest path between two certain vertices.
Dijkastra Example
Number of decreaseKeys is 14. All updates except Stage 0 and the circled ones.