POJ 2387 Til the Cows Come Home -最短路径
2014-08-06 10:49
405 查看
/* 题目链接:http://poj.org/problem?id=2387 <p>题意:</p><p>输入T、N</p><p>N表示点的数目。T表示边的数目</p><p>下面T行输入 :起点、终点、权值</p><p> </p>*/ //优先队列优化的Dijkstra<pre name="code" class="cpp">#include<cstdio> #define INF 2000000000 const int N=1001; int G ; int dijkstra(int s,int n) { int dis ; bool vis ={0}; int pos=1,i,j,min; for(int i=1;i<=n;++i) dis[i]=G[pos][i]; vis[pos]=true; dis[s]=0; for(i=1;i<n;++i){ for(min=INF,j=1;j<=n;++j){ if(!vis[j]&&dis[j]<min&&dis[j]){ min=dis[j]; pos=j; } } vis[pos]=true; for(j=1;j<=n;++j)if(!vis[j]){ if(dis[j]>G[pos][j]+dis[pos]){ dis[j]=G[pos][j]+dis[pos]; } } } return dis ; } int main() { int t,n; while(~scanf("%d %d",&t,&n)){ for(int i=0;i<=n;++i) for(int j=0;j<=n;++j) G[i][j]=INF; for(int i=0;i<t;++i){ int s,e,dis; scanf("%d %d %d",&s,&e,&dis); if(dis<G[s][e]) G[s][e]=G[e][s]=dis; } printf("%d\n",dijkstra(1,n)); } }
//第二种:
#include<cstdio>#include<queue>#define INF 888888888const int MAX=1111;using namespace std;struct node{ int end_tag,dis; node(int e,int d):end_tag(e),dis(d){} bool operator<(const node &b)const{ return dis<b.dis; }};vector<node> edge[MAX];int dis[MAX];void
dijkstra(int s,int n){ int i; for(int i=0;i<=n;++i) dis[i]=INF; dis[s]=0; priority_queue<node> q; q.push(node(s,dis[s])); while(!q.empty()){ node x= q.top();q.pop(); for(i=0;i<edge[x.end_tag].size();++i){ node y=edge[x.end_tag][i]; if(dis[y.end_tag]>y.dis+x.dis){
dis[y.end_tag]=y.dis+x.dis; q.push(node(y.end_tag,dis[y.end_tag])); } } }}int main(){ int t,n; while(~scanf("%d %d",&t,&n)){ for(int i=0;i<t;++i){ int s,e,dis; scanf("%d %d %d",&s,&e,&dis); edge[s].push_back(node(e,dis)); edge[e].push_back(node(s,dis)); }
dijkstra(1,n); printf("%d\n",dis
); }}
相关文章推荐
- Poj 2387 Til the Cows Come Home(Dijkstra 最短路径)
- POJ 2387 Til the Cows Come Home(最短路径)
- POJ 2387 Til the Cows Come Home --单源最短路径
- POJ_2387_Til the Cows Come Home(USACO 2004 November)_最短路径
- poj2387——Til the Cows Come Home(最短路径)
- POJ 2387 Til the Cows Come Home (最短路径,Dijkstra算法)
- POJ-2387 Til the Cows Come Home(Dijsktra算法求最短路径)
- (阶段三 dijkstra算法温习 1.6)POJ 2387 Til the Cows Come Home(使用dijkstra算法求单源起点和单源终点的最短路径)
- POJ 2387 Til the Cows Come Home (图论,最短路径)
- poj 2387 Til the Cows Come Home(最短路径)
- POJ 2387 Til the Cows Come Home Dijkstra求最短路径
- Poj 2387 Til the Cows Come Home(Dijkstra 最短路径)
- Til the Cows Come Home(poj 2387 Dijkstra算法(单源最短路径))
- POJ 2387 Til the Cows Come Home(最短路径,模板题)
- [POJ](2387)Til the Cows Come Home---单源最短路径(图)
- poj 2387 Til the Cows Come Home//最短路径
- poj 2387 Til the Cows Come Home(最短路SPFA+Dijkstra)
- poj 2387 Til the Cows Come Home(最短路水题 = =)
- POJ 2387 Til the Cows Come Home (最短路+Dijkstra)
- poj2387 - Til the Cows Come Home(最短路径问题) (Dijkstra)