法1:Dijkstra+pre数组+c数组
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXV=510;
const int INF=0x3f3f3f3f;
int G[MAXV][MAXV];
bool vis[MAXV];
int cost[MAXV][MAXV];
int d[MAXV],c[MAXV],pre[MAXV];
int n,m,st,ed;
void Dijkstra(int s){
memset(d,INF,sizeof(d));
memset(c,INF,sizeof(c));
d[s]=0;
c[s]=0;//
for(int i=0;i<n;++i){
int u=-1,MIN=INF;
for(int j=0;j<n;++j){
if(vis[j]==false&&d[j]<MIN){
u=j;
MIN=d[j];
}
}
if(u==-1)return;
vis[u]=true;//
for(int v=0;v<n;++v){
if(vis[v]==false&&G[u][v]!=INF){
if(d[u]+G[u][v]<d[v]){
d[v]=d[u]+G[u][v];
c[v]=c[u]+cost[u][v];
pre[v]=u;
}else if(d[u]+G[u][v]==d[v]){
if(c[u]+cost[u][v]<c[v]){
c[v]=c[u]+cost[u][v];
pre[v]=u;
}
}
}
}
}
}
void DFS(int v){
if(v==st){
printf("%d ",v);
return;
}
DFS(pre[v]);
printf("%d ",v);
}
int main(){
scanf("%d%d%d%d",&n,&m,&st,&ed);
memset(G,INF,sizeof(G));//
int u,v;
for(int i=0;i<m;++i){
scanf("%d%d",&u,&v);
scanf("%d%d",&G[u][v],&cost[u][v]);
G[v][u]=G[u][v];
cost[v][u]=cost[u][v];
}
Dijkstra(st);
DFS(ed);
printf("%d %d\n",d[ed],c[ed]);
return 0;
}
法2:Dijkstra + DFS + vector<int> path, tempPath, pre[MAXV] + minCost
#include<bits/stdc++.h>
using namespace std;
const int MAXV=510;
const int INF=0x3f3f3f3f;
int G[MAXV][MAXV];
bool vis[MAXV];
int cost[MAXV][MAXV];
int d[MAXV];
int minCost=INF;
int n,m,st,ed;
vector<int>pre[MAXV];
vector<int>path,tempPath;
void Dijkstra(int s){
memset(d,INF,sizeof(d));
d[s]=0;
for(int i=0;i<n;++i){
int u=-1,MIN=INF;
for(int j=0;j<n;++j){
if(vis[j]==false&&d[j]<MIN){
u=j;
MIN=d[j];
}
}
if(u==-1) return;
vis[u]=true;
for(int v=0;v<n;++v){
if(vis[v]==false&&G[u][v]!=INF){
if(d[u]+G[u][v]<d[v]){
d[v]=d[u]+G[u][v];
pre[v].clear();
pre[v].push_back(u);
}else if(d[u]+G[u][v]==d[v]){
pre[v].push_back(u);
}
}
}
}
}
void DFS(int v){
if(v==st){
tempPath.push_back(v);
int tempCost=0;
for(int i=tempPath.size()-1;i>0;--i){
int id=tempPath[i],idNext=tempPath[i-1];
tempCost+=cost[id][idNext];
}
if(tempCost<minCost){
minCost=tempCost;
path=tempPath;
}
tempPath.pop_back();
return;
}
tempPath.push_back(v);
for(int i=0;i<pre[v].size();++i){
DFS(pre[v][i]);
}
tempPath.pop_back();
}
int main(){
scanf("%d%d%d%d",&n,&m,&st,&ed);
memset(G,INF,sizeof(G));//
int u,v;
for(int i=0;i<m;++i){
scanf("%d%d",&u,&v);
scanf("%d%d",&G[u][v],&cost[u][v]);
G[v][u]=G[u][v];
cost[v][u]=cost[u][v];
}
Dijkstra(st);
DFS(ed);
for(int i=path.size()-1;i>=0;--i) printf("%d ",path[i]);
printf("%d %d\n",d[ed],minCost);
return 0;
}