Floyd-Warshall Code

for (int m = 0; m < V; m++) // Transit
{
    for (int i = 0; i < V; i++) // Source
    {
        for (int k = 0; k < V; k++) // Destination
        {
            if (dist[i][m] + dist[m][k] < dist[i][k])
                dist[i][k] = dist[i][m] + dist[m][k];
        }
    }
}