floydwarshall algorithm

gistfile1.txt

void FloydWarshall(int distance[maxVertices][maxVertices],int vertices)
{
        int from,to,via;
        for(from=0;from<vertices;from++)
        {
                for(to=0;to<vertices;to++)
                {
                        for(via=0;via<vertices;via++)
                        {
                                distance[from][to] = min(distance[from][to],
                                                         distance[from][via]+distance[via][to]);
                        }
                }
        }
}