Thuật toán Johnson
Sign in to savealgorithm 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
Wikidata facts
- Instance of
- shortest path problem
Show 3 more facts
- publication date
- 1977-00-00
- Commons category
- Johnson's algorithm
Sources (1)
via Wikidata · CC0