Johnson's algorithm (Q2345824)
Jump to navigation
Jump to search
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
Statements
1977
0 references
0 references
Johnson's algorithm
0 references
Identifiers
Sitelinks
Wikipedia(15 entries)
- cswiki Johnsonův algoritmus
- enwiki Johnson's algorithm
- eswiki Algoritmo de Johnson
- fawiki الگوریتم جانسون
- frwiki Algorithme de Johnson
- hewiki האלגוריתם של ג'ונסון
- huwiki Johnson algoritmusa
- plwiki Algorytm Johnsona
- ptwiki Algoritmo de Johnson
- ruwiki Алгоритм Джонсона
- srwiki Džonsonov algoritam
- thwiki ขั้นตอนวิธีของจอห์นสัน
- trwiki Johnson algoritması
- ukwiki Алгоритм Джонсона
- viwiki Thuật toán Johnson
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki Category:Johnson's algorithm