Johnson's algorithm
algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest
Facts
7 properties- Instance of
- algorithm, graph algorithm, shortest path problem[2][3]
- Publication date
- 1977[5]
- Computes solution to
- all-pairs shortest path problem[6]
- Discoverer or inventor
- Donald B. Johnson[1]
- Named after
- Donald B. Johnson[4]
- Worst-case time complexity
- O (|V|^2 \log |V| + |V||E|)
🏷️ Also known as
en Johnson's algorithm
cs Johnsonův algoritmus
es algoritmo de Johnson
fa الگوریتم جانسون
fr algorithme de Johnson
he האלגוריתם של ג'ונסון
hu Johnson algoritmusa
it algoritmo di Johnson
ja ジョンソン法 (グラフ理論)
pl algorytm Johnsona
ru Алгоритм Джонсона
th ขั้นตอนวิธีของจอห์นสัน
th อัลกอริทึมของ Johnson
tr Johnson algoritması
tr Jonhson algoritması
vi Thuật toán Johnson
zh Johnson最短路算法
zh 约翰逊算法
zh-hans johnson算法
🔖 Identifiers · 4
- Brilliant Wiki ID
- johnsons-algorithm
- Dictionary of Algorithms and Data Structures ID
- johnsonsAlgorithm
- Freebase ID
- /m/04q0b2
- Microsoft Academic ID (discontinued)
- 10187374
🔗 Connections
Instance of 2
Discoverer or inventor 1
Named after 1
Uses 1
Press Enter · cited answer in seconds