最短路的模板题 用dijkstra就可以
#include<cstdio>
#include<cstring>#include<vector>
#include<queue>
#define maxn 100001
using namespace std;
struct Edge
{
int from,to,dist;
};
struct heapnode
{
int d,u;
bool operator < (const heapnode &rhs) const
{
return d>rhs.d;
}
};
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
bool done[maxn];
int p[maxn];
int d[maxn];
void init(int n)
{
//this->n=n;
for(int i = 0; i < n; i++)
G[i].clear();
edges.clear();
}
void Addedge(int from,int to,int dist)
{
edges.push_back((Edge)
{
from,to,dist
});
int m = edges.size();
G[from].push_back(m-1);
}
void dijkstra(int s)
{
int INF = 1<<30;
priority_queue<heapnode> Q;
for(int i = 0; i < n; i++)
d[i] = INF;
d[s] = 0;
memset(done,0,sizeof(done));
Q.push((heapnode)
{
0,s
});
while(!Q.empty())
{
heapnode x = Q.top();
Q.pop();
int u = x.u;
if(done[u]) continue;
done[u]=true;
for(int i = 0; i < G[u].size(); i++)
{
Edge& e = edges[G[u][i]];
if(d[e.to]>d[u]+e.dist)
{
d[e.to] = d[u]+e.dist;
p[e.to] = G[u][i];
Q.push((heapnode)
{
d[e.to],e.to
});
}
}
}
}
int main()
{
int t1,s,t,count=0;
int f,to,di;
scanf("%d",&t1);
while(t1--)
{
memset(d,-1,sizeof(d));
memset(p,-1,sizeof(p));
scanf("%d %d %d %d",&n,&m,&s,&t);
init(n);
for(int i = 0; i < m; i++)
{
scanf("%d %d %d",&f,&to,&di);
Addedge(f,to,di);
Addedge(to,f,di);
}
dijkstra(s);
printf("Case #%d: ",++count);
if(done[t]!=0)
printf("%d\n",d[t]);
else
puts("unreachable");
}
return 0;
}