弗洛伊德最短路径算法

#include<iostream>
using namespace std;
#define MAX 1000
typedef struct graph
{
	int e;
	int n;
	int arcs[10][10];
}Graph;
Graph gra;
//O(n^3)
void Init()
{
	for (int i = 0; i < 10; i++)
		for (int j = 0; j < 10; j++)
		{
			if(i==j)
				gra.arcs[i][j] = 0 ;
			else
				gra.arcs[i][j] = MAX;
		}
	int v1, v2,weight;
	cout << "输入点与边数";
	cin >> gra.n >> gra.e;
	cout << "分别输入边的起始点与终止点，以及对应的权值"<<endl;
	for (int i = 0; i < gra.e; i++)
	{
		cout << "v1,v2 = ";
		cin >> v1 >> v2;
		cout << "weight = ";
		cin >> weight;
		gra.arcs[v2][v1] = gra.arcs[v1][v2] = weight;
	}
}
int path[][10] = { -1 }; //记录要经过的路径
/*
	例：P:
		-1  -1   3  -1
		 3  -1   3  -1
		-1  -1  -1  -1
		 2   2  -1  -1
	求1-0的顶点序列
		1）由于P[1][0]=3 , 所以要经过3
		2）P[3][0]=2,所以又经过2
		3）P[2][0]=-1 ,结束。
	序列为： 1 -> 3 -> 2 -> 0  
*/
int A[][10] = { 0 }; //保存最小路径
void Floyd()
{
	int i, j, k;
	//初始化操作
	for (i = 0; i < gra.n; i++)
		for (j = 0; j < gra.n; j++) 
		{
			A[i][j] = gra.arcs[i][j];
			path[i][j] = -1;
		}
	//核心：
	for (i = 0; i < gra.n; i++)
		for (j = 0; j < gra.n; j++)
			for (k = 0; k < gra.n; k++)
			{
				if (A[i][k] + A[k][j] < A[i][j])
				{
					A[i][j] = A[i][k] + A[k][j];
					path[i][j] = k;
				}
			}
	
}
//递归输出 i 到 j 的路径
void PrintPath(int i, int j)
{
	if (path[i][j] == -1)
		cout << i <<" -> " <<j << endl;
	else
	{
		int mid = path[i][j];
		PrintPath(i, mid);
		PrintPath(mid, j);
	}
}
int main(void)
{
	Init();
	Floyd();
	
	for (int i = 0; i < gra.n; i++)
	{
		for (int j = 0; j < gra.n; j++)
			cout << A[i][j] << ' ';
		cout << endl;
	}
	//PrintPath(0, 3);
	system("pause");
	return 0;
}