图论—Floyd

可求出图中任意两个点的最短路，但O(n^3);

#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;

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

void floyd() {
	for (int k = 1; k <= n; k++ )
		for (int i = 1; i <= n; i++ )
			for (int j = 1; j <= n; j++ )
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}

int main( ) {
	cin >> n >> m;//n个节点m条边
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			if(i == j) d[i][j] = 0;
			else d[i][j] = 0x7ffffff;
		}
	}
	while(m--) {
		int u,v,w;
		cin >> u >> v >> w;
		d[u][v] = w;
		d[v][u] = w;
	}
	floyd();
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			cout << d[i][j];
			cout << ( j == n ? '\n' : ' ');
		}
	}
		
	return 0;
}

例题：：【模板】Floyd 算法 - 洛谷