The Fastest Drive, Not the Fewest Roads: Dijkstra's Algorithm
Find the fastest route through a town where every road takes a different number of minutes: why counting roads, always taking the shortest next road and trying every route all fail, and the algorithm a GPS uses instead, Dijkstra's algorithm, made fast by a priority queue.
Updated
- Category
- Data Structures
- Level
- Freelancer
- Tags
- Breadth-First Search, data structures, Dijkstra's Algorithm, Shortest Path, Weighted Graph