Bellman_Ford 模板

版权声明：希望能帮到弱校的ACMer成长，因为自己是弱校菜鸡~~~~ https://blog.csdn.net/Mr__Charles/article/details/82081723

Bellman_Ford 模板

#include<cstdio>
#include<algorithm>
#define maxn 10005
#define INF 0x3f3f3f3f
using namespace std; 

int n,m,u[maxn],v[maxn],w[maxn],dis[maxn];

void init(){
	for(int i=1; i<=n; i++)
		dis[i] = ( i == 1 ) ? 0 : INF;
} 

void Bellman_ford(){
	for(int k=1; k<n; k++)
	    for(int i=1; i<=m; i++)
	        dis[v[i]] = min(dis[v[i]],dis[u[i]]+w[i]);
} 

int main(){
	int a,b,c;
	while(scanf("%d%d",&n,&m),n+m){
		init();
		for(int i=1; i<=m; i++)
			scanf("%d%d%d",&u[i],&v[i],&w[i]);
		Bellman_ford();
		printf("%d\n",dis[n]);
	}
	return 0;
}