Floyd Warshall's Algorithm.

The Floyd Warshall Algorithm is for solving all pairs shortest path problems. The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed Graph.
Please provide a working code for this algorithm.