Floyd–Warshall algorithm

From Wikipedia, the free encyclopedia

"Floyd's algorithm" redirects here. For cycle detection, see Floyd's cycle-finding algorithm.
Graph search algorithms
Search

In computer science, the Floyd–Warshall algorithm (sometimes known as the Roy–Floyd algorithm or WFI Algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed graph. A single execution of the algorithm will find the shortest path between all pairs of vertices. The Floyd–Warshall algorithm is an example of dynamic programming.

Contents

[edit] Algorithm

The Floyd-Warshall algorithm compares all possible paths through the graph between each pair of vertices. It is able to do this with only V3 comparisons (this is remarkable considering that there may be up to V2 edges in the graph, and every combination of edges is tested). It does so by incrementally improving an estimate on the shortest path between two vertices, until the estimate is known to be optimal.

Consider a graph G with vertices V, each numbered 1 through N. Further consider a function shortestPath(i,j,k) that returns the shortest possible path from i to j using only vertices 1 through k as intermediate points along the way. Now, given this function, our goal is to find the shortest path from each i to each j using only nodes 1 through k + 1.

There are two candidates for this path: either the true shortest path only uses nodes in the set (1...k); or there exists some path that goes from i to k + 1, then from k + 1 to j that is better. We know that the best path from i to j that only uses nodes 1 through k is defined by shortestPath(i,j,k), and it is clear that if there were a better path from i to k + 1 to j, then the length of this path would be the concatenation of the shortest path from i to k + 1 (using vertices in (1...k)) and the shortest path from k + 1 to j (also using vertices in (1...k)).

Therefore, we can define shortestPath(i,j,k) in terms of the following recursive formula:

\textrm{shortestPath}(i,j,k) = \min(\textrm{shortestPath}(i,j,k-1),\textrm{shortestPath}(i,k,k-1)\,+\,\textrm{shortestPath}(k,j,k-1));\,\!

\textrm{shortestPath}(i,j,0) = \textrm{edgeCost}(i,j);\,\!

This formula is the heart of Floyd Warshall. The algorithm works by first computing shortestPath(i,j,1) for all (i,j) pairs, then using that to find shortestPath(i,j,2) for all (i,j) pairs, etc. This process continues until k=n, and we have found the shortest path for all (i,j) pairs using any intermediate vertices.

[edit] Pseudocode

Conveniently, when calculating the kth case, one can overwrite the information saved from the computation of k − 1. This means the algorithm uses quadratic memory. Be careful to note the initialization conditions:

 1 /* Assume a function edgeCost(i,j) which returns the cost of the edge from i to j
 2    (infinity if there is none).
 3    Also assume that n is the number of vertices and edgeCost(i,i)=0
 4 */
 5
 6 int path[][];
 7 /* A 2-Dimensional matrix. At each step in the algorithm, path[i][j] is the shortest path
 8    from i to j using intermediate values in (1..k-1).  Each path[i][j] is initialized to
 9    edgeCost(i,j).
10 */
11
12 procedure FloydWarshall ()
13    for k: = 0 to n − 1
15       for each (i,j) in (0..n − 1)
17          path[i][j] = min ( path[i][j], path[i][k]+path[k][j] );

[edit] Behaviour with negative cycles

For numerically meaningful output, Floyd-Warshall assumes that there are no negative cycles (in fact, between any pair of vertices which form part of a negative cycle, the shortest path is not well-defined because the path can be infinitely small). Nevertheless, if there are negative cycles, Floyd–Warshall can be used to detect them. If you run an algorithm one more time, some paths can decrease, but it does not guarantee, that between all vertices, ways between which can be infinitely small, the path decreased. If the number in diagonal of path matrix is negative, it is necessary and sufficient for this vertex to belong to negative cycle.

 Please help improve this section by expanding it.
Further information might be found on the talk page or at requests for expansion.


[edit] Analysis

To find all n2 of \mathcal{W}_k from those of \mathcal{W}_{\mathit{k}-1} requires 2n2 bit operations. Since we begin with \mathcal{W}_0 = \mathcal{W}_\mathcal{R} and compute the sequence of n zero-one matrices \mathcal{W}_1, \mathcal{W}_2, ..., \mathcal{W}_\mathit{n} = \mathcal{M}_{\mathcal{R}^*}, the total number of bit operations used is \mathit{n} \times 2\mathit{n}^2 = 2\mathit{n}^3. Therefore, the complexity of the algorithm is Θ(n3) and can be solved by a deterministic machine in polynomial time.

[edit] Applications and generalizations

The Floyd–Warshall algorithm can be used to solve the following problems, among others:

  • Shortest paths in directed graphs (Floyd's algorithm).
  • Transitive closure of directed graphs (Warshall's algorithm). In Warshall's original formulation of the algorithm, the graph is unweighted and represented by a Boolean adjacency matrix. Then the addition operation is replaced by logical conjunction (AND) and the minimum operation by logical disjunction (OR).
  • Finding a regular expression denoting the regular language accepted by a finite automaton (Kleene's algorithm)
  • Inversion of real matrices (Gauss-Jordan algorithm).
  • Optimal routing. In this application one is interested in finding the path with the maximum flow between two vertices. This means that, rather than taking minima as in the pseudocode above, one instead takes maxima. The edge weights represent fixed constraints on flow. Path weights represent bottlenecks; so the addition operation above is replaced by the minimum operation.
  • Testing whether an undirected graph is bipartite.

[edit] Implementations

  • A Perl implementation is available in the Graph module
  • A Javascript implementation is available at Alex Le's Blog
  • A Python implementation is available in the NetworkX package
  • A C implementation is available at ece.rice.edu (Although it claims to be being implemented in C++, C language idioms are used, whereas the implementation doesn't use any C++ paradigms. The implementation should be accepted by any C++ compiler, though.)
  • A C++ implementation is available in the boost::graph library
  • A Matlab implementation is available at the Department of Electrical Engineering and Computer Science University of Kansas, Lawrence, KS called the "Graph Generation and Testing Application"

[edit] References

[edit] See also

[edit] External links