void Floyd(AdjMWGraph &G, int **distance, int **path)
//求圖G中每對(duì)頂點(diǎn)之間的最短距離distance和最短路徑的頂點(diǎn)序號(hào)path
{
	int i, j, k;
	int n = G.NumOfVertices();
   
	//初始化
	for(i = 0; i < n; i++) 
		for(j = 0; j < n; j++)
		{
			distance[i][j] = G.GetWeight(i, j);
			Path[i][j] = 0;
		}

	for(k = 0; k < n; k++)
		for(i = 0; i < n; i++)
			for(j = 0; j < n; j++)
				if(distance[i][j] > (distance[i][k] + distance[k][j]))
				{
					distance[i][j] = distance[i][k] + distance[k][j];
					Path[i][j] = k;
				}
}