Dijkstra算法求最短路
来源:互联网 发布:淘宝折扣网站 编辑:程序博客网 时间:2024/04/30 00:15
Heavy Transportation
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 26760 Accepted: 7148
Description
Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.
Sample Input
13 31 2 31 3 42 3 5
Sample Output
Scenario #1:4
#include <iostream> using namespace std; #define MAXV 1010 #define min(a,b) (a<b?a:b) int map[MAXV][MAXV],n,m; int dijkstra(){ int vis[MAXV],d[MAXV],i,j,v; for(i=1;i<=n;i++){ vis[i]=0; d[i]=map[1][i]; //这个时候d不代表从1到n的最短路径,而是最大承载量 } for(i=1;i<=n;i++){ int f=-1; for(j=1;j<=n;j++) if(!vis[j] && d[j]>f){ f=d[j]; v=j; } vis[v]=1; for(j=1;j<=n;j++) if(!vis[j] && d[j]<min(d[v],map[v][j])){ d[j]=min(d[v],map[v][j]); } } return d[n]; } int main(){ int t,i,j,sum,a,b,c; scanf("%d",&sum); for(t=1;t<=sum;t++){ scanf("%d%d",&n,&m); for(i=0;i<=n;i++) for(j=0;j<=n;j++) map[i][j]=0; for(i=1;i<=m;i++){ scanf("%d%d%d",&a,&b,&c); map[a][b]=map[b][a]=c; } printf("Scenario #%d:\n",t); printf("%d\n\n",dijkstra()); } return 0; }
0 0
- Dijkstra算法求最短路
- hdu2544最短路 Dijkstra 算法求最短路
- Dijkstra 求最短路
- Dijkstra 求最短路
- sdut 2622 最短路径(Dijkstra算法求最短路)
- 最短路 Dijkstra算法
- 最短路算法Dijkstra
- Dijkstra最短路算法
- 最短路,dijkstra算法。
- 最短路-Dijkstra算法
- 最短路 Dijkstra算法
- 最短路 Dijkstra算法
- Dijkstra最短路算法
- 最短路-Dijkstra算法
- Dijkstra最短路算法
- 最短路Dijkstra算法
- Dijkstra最短路算法
- 最短路Dijkstra算法
- Java与机器交互神器插件expect
- Android-MVVM架构-Data Binding的使用
- 遇见 App.Config 、SAE 、 WEB
- OpenJudge百炼习题解答(C++)--题1936:全在其中
- 1036. 跟奥巴马一起编程
- Dijkstra算法求最短路
- LinkageError
- 《Android Studio实用指南》7.1 AndroidStudio代码检查工具概述
- HTTPS通信机制
- Firefox火狐
- Struts2之国际化
- 线段树(hdu1166)
- BZOJ_P1001 [BeiJing2006]狼抓兔子(网络流转换+Dijkstra)
- 单例