Johnson's algorithm

（重定向自Johnson algorithm）

Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in a sparse, edge weighted, directed graph. It allows some of the edge weights to be negative numbers, but no negative-weight cycles may exist. It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph. It is named after Donald B. Johnson, who first published the technique in 1977.

单词	Johnson algorithm
释义	Johnson algorithm 英语百科 Johnson's algorithm （重定向自Johnson algorithm） Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in a sparse, edge weighted, directed graph. It allows some of the edge weights to be negative numbers, but no negative-weight cycles may exist. It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph. It is named after Donald B. Johnson, who first published the technique in 1977.
随便看	rolling error rolling experiment rolling extractor rolling face rolling fiddle rolling fire door rolling fixture rolling flaying machine rolling flight rolling force ROLLING for compacting foundation soil Rolling forecast rolling forex rolling forming machine Rolling friction rolling frictional resistance rolling friction method rolling friction torque rolling from the molten condition rolling fulcrum Rolling gate rolling gear rolling grade rolling grille door rolling grilles