![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
acm_最短路径
wdcxccsdn
这个作者很懒,什么都没留下…
展开
-
hdoj2544_最短路(最短路径)
思路:kruskal#include<string.h>#include<iostream>#include<cstdio>#include<vector>#include<algorithm>#include<string.h>#include<utility>using namespace std;vector<pair<int, int> > edge[200];bool u原创 2015-05-21 17:21:12 · 371 阅读 · 0 评论 -
poj2797_106 miles to Chicago(最短路径)
#include<iostream>#include<vector>#include<algorithm>#include<string.h>#include<utility>#include<iomanip>using namespace std;vector<pair<int, double>> edge[110];bool used[110];double perc[110];原创 2015-05-22 18:24:22 · 528 阅读 · 0 评论 -
zoj1221_Risk(多源点最短路)
多源点最短路,floyd#include<iostream>#include<vector>#include<cstdio>using namespace std;int map[25][25];void floyd(){ for (int k = 1; k <= 20; k++) for (int i = 1; i <= 20; i++) f原创 2015-06-06 19:28:36 · 990 阅读 · 0 评论 -
hdoj3790_最短路径问题(最短路径)
#include<cstdio>#include<iostream>#include<vector>#include<string.h>using namespace std;struct edge{ int npos, dis, cost;};vector<edge> edges[2010];pair<int, int> res[2010];bool used[2010];v原创 2015-05-24 12:28:24 · 497 阅读 · 0 评论 -
hdoj1385_Minimum Transport Cost(多源最短路)
思路:floyd#include<iostream>#include<string.h>#include<vector>#include<algorithm>using namespace std;vector<int> pathcost[10000];vector<int> pre[10000];vector<int> cost[10000];vector<int> citycost原创 2015-06-13 11:39:21 · 390 阅读 · 0 评论