蒟蒻Floyd 60分求救
查看原帖
蒟蒻Floyd 60分求救
1072481
shdshshshz楼主2024/10/19 20:10
#include <bits/stdc++.h>
using namespace std;
int n, m, a[105][105], u, v, w;
int main()
{
	memset(a, 0x3f, sizeof(a));
	cin >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		cin >> u >> v >> w;
		a[u][v] = w;
		a[v][u] = w;
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			for (int k = 1; k <= n; k++)
				a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (i == j)
				a[i][j] = 0;
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}

2024/10/19 20:10
加载中...