floyd + path

int floyd(int s, int e, int n)
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (map[i][j] < MAX)
            {    
                path[i][j] = j;
            }
            else
            {
                path[i][j] = -1;
            }
        }
    }
    for (int k = 1; k <= n; k++)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                 if (map[i][j] < map[i][k] + map[k][j])
                {
                    map[i][j] = map[i][k] + map[k][j];
                    path[i][j] = path[i][k];
                }      

            }
        }
    }
    return map[s][e];
}