先以终点为起点跑一遍Dijkstra,求出各点到终点的最短路,然后按要求重新建图,求路径条数。
设deg[u]为从顶点u出发到终点路径条数。则deg[u]+=deg[v],其中u->v为新图中的有向边。
初始化deg[2]=1,其余顶点为-1。
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 1005
struct HeapNode{ //优先队列结点
int d,u;
bool operator < (const HeapNode& rhs) const{
return d>rhs.d;
}
};
struct Edge{ //边
int from,to,dist;
};
struct Dijkstra{
int n,m; //点数和边数
vector<Edge> edges; //边列表
vector<int> G[maxn]; //每个结点出发的边编号(从0开始)
bool done[maxn]; //是否已永久标号
int d[maxn]; //s到各个点的距离
int p[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});
m=edges.size();
G[from].push_back(m-1);
}
void dijkstra(int s){ //求s到所有点的最短距离
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]=1;
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]=e.from;
Q.push(HeapNode{d[e.to],e.to});
}
}
}
}
void output(int s,int e,vector<int>& path){
int pos=e;
while(1){
path.push_back(pos);
if(pos==s) break;
pos=p[pos];
}
}
};
bool E[1005][1005];
int deg[1005];
int dfs(int n,int u){
if(deg[u]!=-1) return deg[u];
deg[u]=0;
for(int i=1;i<=n;++i)
if(E[u][i]) deg[u]+=dfs(n,i);
return deg[u];
}
int main()
{
int n,m,i,j,x,y,z;
while(~scanf("%d",&n)&&n)
{
Dijkstra D;
memset(E,0,sizeof(E));
memset(deg,-1,sizeof(deg));
D.init(n);
scanf("%d",&m);
while(m--){
scanf("%d%d%d",&x,&y,&z);
D.addEdge(x,y,z);
D.addEdge(y,x,z);
}
D.dijkstra(2);
deg[2]=1;
for(i=0;i<D.edges.size();i+=2){
Edge e=D.edges[i];
if(D.d[e.from]>D.d[e.to]) E[e.from][e.to]=1;
else if(D.d[e.from]<D.d[e.to]) E[e.to][e.from]=1;
}
printf("%d\n",dfs(n,1));
}
return 0;
}