九度教程77题
要求输出起点到终点的最短路径及其花费,如果最短路径有多条路线,则输出花费最少的。
提示
更改Dijkstra算法中关于“更近”的评判标准:有两条路径,当他们距离不一样时,距离小的更近;若距离一样时,花费少的更近。
代码
//节点之间不仅有距离还有花费,输出距离最短并且花费最少的路径
#include<iostream>
#include<vector>
using namespace std;
struct E{
int next;
int d;
int c;
};
vector<E> edge[1001];
bool mark[1001];
int dis[1001];
int sum[1001];
int main(){
int n, m;
int s, t, d, p;
cin >> n >> m;
while (n != 0 && m != 0){
//初始化数据
for (int i = 1; i <= n; i++){
edge[i].clear();
mark[i] = false;
dis[i] = -1;
sum[i] = 0;
}
//初始化邻接链表
while (m--){
cin >> s >> t >> d >> p;
E tmp;
tmp.next = t;
tmp.d = d;
tmp.c = p;
edge[s].push_back(tmp);
tmp.next = s;
edge[t].push_back(tmp);
}
//求单源最短路径
cin >> s >> t;
dis[s] = 0;
mark[s] = true;//将s加入集合K
int newP = s;
for (int i = 1; i <= n; i++){//循环N-1次,将所有节点都加入集合K
for (int j = 0; j < edge[newP].size(); j++){//每次循环更新dis数组
int nextP = edge[newP][j].next;
int cost = edge[newP][j].c;
int di = edge[newP][j].d;
if (mark[nextP] == true){
continue;
}
//判断更新数组的条件
//在本题条件下,当距离不同时,选距离最短的那条,当距离相同时,选择花费最少的那条
if (dis[nextP] == -1 || dis[nextP] > dis[newP] + d || (dis[nextP] == dis[newP] + d&&sum[nextP] > sum[newP] + cost)){
dis[nextP] = dis[newP] + di;
sum[nextP] = sum[newP] + cost;
}
}
//选择路径最短的节点,加入集合K
int min = 123123;
for (int j = 1; j <= n; j++){
if (mark[j] == true){
continue;
}
if (dis[j] == -1){
continue;
}
if (min > dis[j]){
min = dis[j];
newP = j;
}
}
mark[newP] = true;
}
cout << dis[t] << ' ' << sum[t] << endl;
cin >> n >> m;
}
return 0;
}