C++ P0002 旅行计划

题目：旅行计划

第一次搞输出多个最短路径，搞了有一会儿，方法不太好，有更好的方法可以教me！

# include <iostream>
# include <cstdio>
# include <cstring>
using namespace std;
const int inf = 0x7fffffff/3;
int n, m, v, ui, vi, ti, park, minx, sizes; 
int cost[110], path[10010], map[110][110], to[10010];
bool vis[110];
int main() {
//	freopen("djs.in", "r", stdin);
//	freopen("djs.out", "w", stdout);
	cin >> n >> m >> v;
	for(int i = 0; i <= n; i++) { // 再求最短路之前，把各各边赋值为+∞ 
		cost[i] = inf;
		for(int j = 0; j <= n; j++)
		    map[i][j] = inf;
	}
	for(int i = 1; i <= m; 	i++) {
		cin >> ui >> vi >> ti;
		map[ui][vi] = ti; // 路径单向储存 
	}
	cost[v] = 0;
	for(in