POJ T2387 Til the Cows Come Home

                 POJ T2387 Til the Cows Come Home

---

 

模板裸题，注意点都在注释了.......

Spfa写法

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

bool vis[maxn];
int dis[maxn],head[maxn],m,n,cnt;

struct Edge{
	int to,cost,next;
}edge[maxn*4];

void Init(){
	cnt = 0;
	for(int i = 1; i <= n; i++){
		vis[i] = false;
		dis[i] = INF;            
		head[i] = -1;     //此处赋值-1，为了head[i]节点遍历完可以判断结束 
	}
}

void add(int from,int to,int cost){  //邻接表，看不懂的童鞋自己模拟过程 
	edge[cnt].to = to;
	edge[cnt].cost = cost;
	edge[cnt].next = head[from];
	head[from] = cnt++;
} 

void Spfa(int s){
	int u;
	queue<int> Q;
	Q.push(s);
	dis[s] = 0;                   
	vis[s] = true;  //标记1 
	while(!Q.empty()){
		u = Q.front();
		Q.pop();          //此处出队列切记 
		vis[u] = false;
		for(int i = head[u]; i!=-1; i = edge[i].next){
			int v = edge[i].to;
			int w = edge[i].cost;
			if(dis[v] > dis[u] + w){
				dis[v] = dis[u] + w;
				if(!vis[v]){
					Q.push(v);      
					vis[v] = true;  //标记2 
				}
			}
		}
	}
}

int main(){
	int u,v,w;
	while(~scanf("%d%d",&m,&n)){
		Init(); 
		for(int i = 0; i < m; i++){
			scanf("%d%d%d",&u,&v,&w);
			add(u,v,w);
			add(v,u,w);
		}
		Spfa(1);
		printf("%d\n",dis[n]);   // 1-n的最短路径，dis[n]即为结果 
	}
	return 0;
}

 

 

 

---

 

Dijkstra写法

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

bool vis[maxn];
int maps[maxn][maxn],dis[maxn],m,n;

void Init(){
	for(int i =1; i <= n; i++){
		vis[i] = false;
		dis[i] = INF;
		for(int j = 1; j <= i; j++)
		    maps[i][j] = maps[j][i] = (i == j) ? 0 : INF;  //注意简约初始化 
	}
}

void Dijkstra(int s){
	for(int i = 1; i <= n; i++) 
	    dis[i] = maps[s][i];
	vis[s] = true;
	
	for(int i = 1; i <= n; i++){
		int minn = INF,p = 0;
		for(int j = 1; j <= n; j++){
			if(!vis[j] && minn > dis[j]){
				minn = dis[j];
				p = j;
			} 
		}
		
		vis[p] = true;   // 注意标记 
		
		for(int j = 1; j <= n; j++){
			if(!vis[j]){
				dis[j] = min(dis[j],dis[p] + maps[p][j]);
			}
		}
	}
}

int main(){
	int u,v,w;
	while(~scanf("%d%d",&m,&n)){
		Init();
		for(int i = 0; i < m; i++){
			scanf("%d%d%d",&u,&v,&w);
			maps[u][v] = maps[v][u] = min(maps[u][v],w);
		}
		Dijkstra(1);
		printf("%d\n",dis[n]);
	}
	return 0;
}