Dijkstra Shortest Path
In plain terms
Dijkstra's algorithm applied to find single-source shortest paths.
Going deeper
It computes the minimum-cost path from a start node to others in a non-negative weighted graph by always expanding the nearest unsettled node. A priority queue makes it efficient.
Under the hood
O((V+E) log V) with a heap; requires non-negative weights, unlike Bellman-Ford.
Examples
GPS navigation, network routing, game pathfinding, logistics.
Think of it like...
Like a ripple of cheapest-cost travel spreading outward, locking in each city's best route as it's reached.