KnowraDijkstra's algorithmLinked fromLinked fromThe 19 pages that link to Dijkstra's algorithm, each with the reason it gives.All 19Broader topic 6Related 6Compared with 7Shortest path problemRelated: It repeatedly settles the nearest unreached vertex, making it the standard nonnegative-weight method.Time complexityRelated: Its running time varies with the data structures used to manage candidate distances.Adjacency listRelated: A weighted adjacency list exposes each vertex's incident edges as the algorithm relaxes them.Structured programmingRelated: Its stepwise refinement illustrates how structured reasoning can organize an algorithm.Google MapsRelated: Road-routing systems solve pathfinding problems over weighted road networks.Priority queueRelated: It repeatedly extracts the unsettled vertex with the smallest tentative distance.