Dijkstra's algorithm
graph search algorithm
Facts
10 propertiesIdentity
- Instance of
- pathfinding algorithm, graph algorithm, greedy algorithm, algorithm[3][4][5]
More facts +9
- Based on
- breadth-first search[7]
- Computes solution to
- shortest path problem, pathfinding, single-source shortest path problem[10][11][12]
- Derivative work
- A* search algorithm, link-state routing protocol, Open Shortest Path First, Intermediate System to Intermediate System[15][16][17][18]
- Different from
- Dykstra's projection algorithm[9]
- Discoverer or inventor
- Edsger W. Dijkstra[2]
- Named after
- Edsger W. Dijkstra[6]
- Time of discovery or invention
- 1959[8]
- Worst-case time complexity
- O(|E|+|V|\cdot log |V|), O(|E|+|V|\log|V|)
🏷️ Also known as
en Dijkstra's algorithm
en Dijkstra algorithm
ar خوارزمية ديكسترا
cs Dijkstrův algoritmus
da Dijkstras algoritme
de Dijkstra-Algorithmus
el Αλγόριθμος του Dijkstra
es Algoritmo de Dijkstra
fa الگوریتم دایکسترا
fi Dijkstran algoritmi
fr algorithme de Dijkstra
he אלגוריתם דייקסטרה
hi डिजक्स्ट्रा का अल्गोरिद्म
hu Dijkstra-algoritmus
id Algoritma Dijkstra
it algoritmo di Dijkstra
ja ダイクストラ法
ja 均一コスト探索
ko 데이크스트라 알고리즘
nl Dijkstra's algoritme
🔖 Identifiers · 11
- OpenAlex ID
- C173870130
- Brilliant Wiki ID
- dijkstras-short-path-finder
- Dictionary of Algorithms and Data Structures ID
- dijkstraalgo
- Freebase ID
- /m/0cf7t
- GitHub topic
- dijkstra-algorithm, dijkstra
- MathWorld ID
- DijkstrasAlgorithm
- Microsoft Academic ID (discontinued)
- 173870130
- Quora topic ID
- Dijkstras-Algorithm-3
- Rosetta Code page ID
- Dijkstra's_algorithm
- Stack Exchange tag
- stackoverflow.com
- Topic's main category
- Category:Dijkstra's algorithm
🔗 Connections
← Based on 5
Derivative work 4
Computes solution to 2
Instance of 2
Uses 2
Based on 1
Created notable works 1
Discoverer or inventor 1
Maintained by WikiProject 1
Named after 1
← SNARC ID 1
← Uses 1
Press Enter · cited answer in seconds
0 sources
Summary
Dijkstra's algorithm is a pathfinding algorithm[1].