poj 2662

#include <iostream>
#include <cstdio>
#include <queue>
#include <map>
#include <vector>
using namespace std;
const int INF=0x7FFFFFFF;
struct EDGE{
	int from,to,dis;
	EDGE *next;
}edge[500010];//存储边
struct heapelem{
	int d,key;
	bool operator < (const heapelem& rhs)const {
		return d>rhs.d;
	}
};//堆中元素类型定义
int size,dis[1010],n,m,dp[1010];
bool is[1010];
EDGE *point[100010];
map<int,vector<int> > ng;//新图的存储，也可在原图上判断操作
priority_queue<heapelem> h;
void addedge(int a,int b,int d)
{
	edge[size].from=a;edge[size].to=b;
	edge[size].next=point[a];point[a]=&edge[size];
	edge[size].dis=d;size++;
}
void dijkstra()
{
	heapelem t;
	t.d=0;t.key=2;
	h.push(t);
	while(!h.empty()){
		t=h.top();h.pop();
		int u=t.key;
		if(is[u]) continue;
		is[u]=true;
		EDGE *k;
		for(k=point[u];k;k=k->next){
			int v=k->to;
			if(dis[v]>dis[u]+k->dis){
				dis[v]=dis[u]+k->dis;
				t.d=dis[v];t.key=v;
				h.push(t);
			}
		}
	}
}//求出每点到家的最短距离
void build()
{
	int f=m<<1,a,b;
	for(int i=0;i<f;i++) if(dis[a=edge[i].from]>dis[b=edge[i].to]){
		if(!ng.count(a)) ng[a]=vector<int>();
		ng[a].push_back(b);
	}
}//构建新图
int dfs(int u)
{
	if(u==2) return 1;
	if(dp[u]) return dp[u];
	for(int i=0;i<ng[u].size();i++){
		dp[u]+=dfs(ng[u][i]);
	}
	return dp[u];
}//记忆化搜索
int main()
{
	//freopen("in.txt","r",stdin);
	while(cin>>n){
		if(n==0) break;
		cin>>m;
		ng.clear();
		for(int i=1;i<=n;i++){
			point[i]=NULL;
			dis[i]=INF;
			is[i]=false;
			dp[i]=0;
		}
		size=0;
		for(int i=1;i<=m;i++){
			int a,b,c;
			cin>>a>>b>>c;
			addedge(a,b,c);
			addedge(b,a,c);
		}
		dis[2]=0;
		dijkstra();
		build();
		cout<<dfs(1)<<endl;
	}
	return 0;
}