1030 Travel Plan

题目大意

给定起点和终点，求两点的最短路径最短距离和花费，要求首先路径最短，其次花费最少，最后要输出完整路径。

---

思路解析

又是典型的多条最短路径选一条问题，套路就是dijkstra+ dfs。与 1018 Public Bike Management属于同一类型，而且还要简单。思路讲解请移步：[1018 Public Bike Management](https://blog.csdn.net/a1552100455/article/details/99683438)

---

示例代码

#include<iostream>
#include<algorithm>
#include<vector>
#define INF (~(0x1<<31))
using namespace std;
int gra[510][510],weight[510][510];
vector<vector<int>> path(510, vector<int>());
vector<int> tempath,finapath;
int least = 99999999;
int n, m, s, d;
void dfs(int d) {
	tempath.push_back(d);
	if (d == s) {
		int tempmost = 0;
		for (int i = tempath.size() - 1; i-1 >= 0; i--) {
			int a = tempath[i], b = tempath[i - 1];
			tempmost += weight[a][b];
		}
		if (tempmost < least) {
			least = tempmost;
			finapath = tempath;
		}
		tempath.pop_back();
		return;
	}
	for (int i = 0; i < path[d].size(); i++)
		dfs(path[d][i]);
	tempath.pop_back();
}
int main() {
	scanf("%d%d%d%d", &n, &m, &s, &d);
	fill(gra[0], gra[0] + 510 * 510, INF);
	for (int i = 0; i < m; i++) {
		int a, b, c, d;
		scanf("%d%d%d%d", &a, &b, &c, &d);
		gra[a][b] = gra[b][a] = c;
		weight[a][b] = weight[b][a] = d;
	}
	bool visited[510] = { false };
	vector<int> dist(510, INF);
	path[s].push_back(s);
	dist[s] = 0;
	for (int i = 0; i < n; i++) {
		int u = -1, min = INF;
		for (int j = 0; j < n; j++) {
			if (!visited[j] && dist[j] < min) {
				u = j;
				min = dist[j];
			}
		}
		visited[u] = true;
		for (int j = 0; j < n; j++) {
			if (!visited[j] && gra[u][j] != INF) {
				if (dist[u] + gra[u][j] < dist[j]) {//找到了新的路径
					path[j].clear();
					path[j].push_back(u);
					dist[j] = gra[u][j] + dist[u];
				}
				else if (gra[s][u] + gra[u][j] == dist[j]) {//距离相等
					path[j].push_back(u);
				}
			}
		}
	}
	dfs(d);
	for (int i = finapath.size() - 1; i >= 0; i--) 
		printf("%d ", finapath[i]);
	printf("%d %d", dist[d],least);
	return 0;
}