Floyd-Warshall's algorithm

The Floyd-Warshall Algorithm is an efficient algorithm to find all-pairs shortest paths on a graph. That is, it is guaranteed to find the shortest path between every pair of vertices in a graph. The graph may have negative weight edges, but no negative weight cycles (for then the shortest path is undefined).

This algorithm can also be used to detect the presence of negative cycles&mdash;the graph has one if at the end of the algorithm, the distance from a vertex $$v$$ to itself is negative.

Algorithm
The Floyd-Warshall Algorithm is an application of Dynamic Programming.

Let $$dist(k,i,j)$$ be the the length of the shortest path from $$i$$ and $$j$$ that uses only the vertices $$v_1, v_2, \ldots, v_k$$ as intermediate vertices. The following recurrence:
 * $$k = 0$$ is our base case - $$dist(0,i,j)$$ is the length of the edge from vertex $$i$$ to vertex $$j$$ if it exists, and $$\infty$$ otherwise.
 * $$dist( k, i, j ) = \min( dist(k-1,i,k) + dist(k-1,k,j), dist(k-1,i,j) )$$: For any vertex $$i$$ and vertex $$j$$, the length of the shortest path from $$i$$ to $$j$$ with all intermediate vertices $$\le k$$ simply does not involve the vertex $$k$$ at all (in which case it is the same as $$dist(k-1,i,j)$$), or that the shorter path goes through vertex $$k$$, so the shortest path between vertex $$i$$ and vertex $$j$$ is the combination of the path from vertex $$i$$ to $$k$$, and from vertex $$k$$ to $$j$$.

After $$N$$ iterations, there is no need anymore to go through any more intermediate vertices, so the distance $$dist( N, i, j )$$ represents the shortest distance between $$i$$ and $$j$$.

Pseudocode
The pseudocode below assumes an input graph of N vertices.

for i = 1 to N  for j = 1 to N      if there is an edge from i to j         dist[0][i][j] = the length of the edge from i to j      else dist[0][i][j] = $$\infty$$ for k = 1 to N  for i = 1 to N      for j = 1 to N         dist[k][i][j] = min(dist[k-1][i][j], dist[k-1][i][k] + dist[k-1][k][j])

This will give the shortest distances between any two nodes, from which shortest paths may be constructed.

This algorithm takes $$\Theta(N^3)$$ time and $$\Theta(N^3)$$ space, and has the distinct advantage of hiding a small constant in its behavior, since very little work is done in the innermost loop. Furthermore, the space-bound can be reduced further to $$\Theta(N^2)$$ by noticing that $$dist( k, i, j )$$ is independent from $$dist( k - 1, i, j )$$.

Implementation
C