Floyd–Warshall algorithm

By ,

The Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. A single execution of the algorithm will find the lengths (summed weights) of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves.

4.50( 2 votes)

Watch Value
StackLine
Comments
CongratBot » Sign in now to reply
Now you've figured it out.
Sign in now to post a comment!