#dijkstra

Dijkstra:Shortest Path When Every Edge Weight Is Non-Negative

Grow a min-heap frontier by current distance, settle each vertex once, and lazy-repush instead of decrease-key — the weighted cousin of BFS when every edge weight is non-negative.

Read More →