floyd算法模板--打印路径

#include 
#include 
#include 
#include 
#define N 1005
#define INF 0x3f3f3f3f

using namespace std;

int m, n;
int map[N][N];

void init()
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (i == j)	map[i][j] = 0;
			else map[i][j] = INF;
		}
	}
}

void creatgraph()
{
	int t1, t2, t3;
	for (int i = 0; i < m; i++)
	{
		scanf("%d%d%d", &t1, &t2, &t3);//两个顶点和权值
		if(map[t1][t2] > t3)//防止出现多次输入相同的两点，取最小值****一定注意
		map[t1][t2] = t3;//有向图
	}
}

void floyed()
{
	for (int k = 1; k <= n; k++)
	{
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				if (map[i][k] < INF && map[k][j] < INF)
					map[i][j] = min(map[i][j], map[i][k] + map[k][j]);
			}
		}
	}
}

void print()
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			printf("%10d ", map[i][j]);
		printf("\n");
	}
}

int main()
{
	while (scanf("%d%d", &n, &m) != EOF)//n个顶点，m条边
	{
		init();//初始化地图
		creatgraph();//建图
		floyed();//核心弗洛伊德算法
		print();//输出最短路结果
	}
	return 0;
}

下边为打印路径的模板

/*floyd算法，打印路径模板*/
#include 
#include 
#include 
#include