CSP 交通规划

#include<iostream>
#include<vector>
#include<map>
using namespace std;
#define MAX 9999

void solution() {
	int m, n,s,e,min,v;
	long int w;
	cin >> m >> n;
	vector<vector<int> > a(m + 1,vector<int>(m+1));
	for (int i = 0; i < n; ++i) {
		cin >> s >> e >> w;
		a[s][e] = w;
	}

	vector<int> D(m + 1,MAX);
	vector<int> P(m + 1, 0);//存放前驱节点
	//vector<int> S(m + 1, 0);//存放新添加的路径长度
	vector<bool> final(m + 1, false);
	final[1] = true;
	
	for (int i = 2; i < m + 1; ++i)
	{
		if (a[1][i] != 0) {
			D[i] = a[1][i];
			P[i] = 1;
			//S[i] = a[1][i];
		}
	}

	for (int i = 2; i <= m; ++i) {
		min = MAX;
		for (int j = 2; j <= m; ++j) {
			if (!final[j]) {
				if (D[j] < min) {
					v = j;
					min = D[j];
				}
			}
		}
		final[v] = true;
		f