Dijkstra's algorithm

Summary

Dijkstra's algorithm is a pathfinding algorithm^[1]. It draws 2,675 Wikipedia views per month (pathfinding_algorithm category, ranking #1 of 5).^[2]

Key Facts

• Dijkstra's algorithm is credited with the discovery of Edsger W. Dijkstra^[3].
• Dijkstra's algorithm's image is recorded as Dijkstra Animation.gif^[4].
• Dijkstra's algorithm's instance of is recorded as pathfinding algorithm^[5].
• Dijkstra's algorithm's instance of is recorded as graph algorithm^[6].
• Dijkstra's algorithm's instance of is recorded as greedy algorithm^[7].
• Dijkstra's algorithm's instance of is recorded as algorithm^[8].
• Edsger W. Dijkstra is named after Dijkstra's algorithm^[9].
• Dijkstra's algorithm's based on is recorded as breadth-first search^[10].
• Dijkstra's algorithm's Commons category is recorded as Dijkstra's algorithm^[11].
• Dijkstra's algorithm's time of discovery or invention is recorded as +1959-00-00T00:00:00Z^[12].
• Dijkstra's algorithm's Freebase ID is recorded as /m/0cf7t^[13].
• Dijkstra's algorithm's topic's main category is recorded as Category:Dijkstra's algorithm^[14].
• Dijkstra's algorithm's Commons gallery is recorded as Dijkstra's algorithm^[15].
• Dijkstra's algorithm's Stack Exchange tag is recorded as https://stackoverflow.com/tags/dijkstra^[16].
• Dijkstra's algorithm's different from is recorded as Dykstra's projection algorithm^[17].
• Dijkstra's algorithm's computes solution to is recorded as shortest path problem^[18].
• Dijkstra's algorithm's computes solution to is recorded as pathfinding^[19].
• Dijkstra's algorithm's computes solution to is recorded as single-source shortest path problem^[20].
• Dijkstra's algorithm's uses is recorded as graph data structure^[21].
• Dijkstra's algorithm's uses is recorded as priority queue^[22].
• Dijkstra's algorithm's MathWorld ID is recorded as DijkstrasAlgorithm^[23].
• Dijkstra's algorithm's Quora topic ID is recorded as Dijkstras-Algorithm-3^[24].
• Dijkstra's algorithm's worst-case time complexity is recorded as O(|E|+|V|\cdot log |V|)^[25].
• Dijkstra's algorithm's worst-case time complexity is recorded as O(|E|+|V|\log|V|)^[26].
• Dijkstra's algorithm's derivative work is recorded as A* search algorithm^[27].

Body

Designation and Status

Recorded instance of include pathfinding algorithm^[5], graph algorithm^[6], greedy algorithm^[7], and algorithm^[8].

History and Context

Edsger W. Dijkstra is named after Dijkstra's algorithm^[9].

Why It Matters

Dijkstra's algorithm draws 2,675 Wikipedia views per month (pathfinding_algorithm category, ranking #1 of 5).^[2] It has Wikipedia articles in 28 language editions, a strong signal of global cultural recognition.^[28] It is known by 4 alternative names across languages and contexts.^[29]