Floyd 任意两点间的最短距离 dp

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#define INF 100000000

using namespace std;

int n,v;
int dp[1005][1005];//dp[i][] 


void Floyd(){
	for(int k = 0; k < n;k ++){
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				dp[i][j] = min(dp[i][j],dp[i][k]+ dp[k][j]);  
			}
		}
	}
}
int main(){
	while(cin >> n >> v){
		
		//必须要初始化 
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				dp[i][j] = INF;
			}
		}
		 
		for(int i = 0;i < v;i++){
			int x,y,w;
			cin >> x >>  y >> w;
			dp[x][y] = w;
			dp[y][x] = w;
		}
		Floyd();
		int q;
		cin >>  q;
		while(q--){
			int x,y;
			cin >>  x >> y;
			cout << dp[x][y] << endl;
		}
	} 
	return 0;
}