![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路
文章平均质量分 82
xiaoxiede_wo
这个作者很懒,什么都没留下…
展开
-
Heavy Transportation
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 cu原创 2017-07-03 11:04:26 · 160 阅读 · 0 评论 -
Wormholes POJ - 3259
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i原创 2017-07-04 17:27:02 · 187 阅读 · 0 评论 -
SPFA-浪里个浪
Time Limit: 1500 mSec Memory Limit : 32768 KB Problem DescriptionTonyY是一个喜欢到处浪的男人,他的梦想是带着兰兰姐姐浪遍天朝的各个角落,不过在此之前,他需要做好规划。现在他的手上有一份天朝地图,上面有n个城市,m条交通路径,每条交通路径都是单行道。他已经预先规划好了一些点作为旅游的起点和终点,他想选择其原创 2017-07-17 18:01:53 · 238 阅读 · 0 评论 -
最短路与最小生成树
最小生成树能够保证整个拓扑图的所有路径之和最小,但不能保证任意两点之间是最短路径。 最短路径是从一点出发,到达目的地的路径最小。 一句话概括:最小生成树是计算从一节点到另一节点的最小边集;最短路是带权路径,计算权值最小。 也就是说,最小生成树要经过每一个点,而最短路只需要能达到某两点,路径权值最小即可!**最短路的算法有Floyd、Dijkstra、Bellman,SPFA 单源就是从...原创 2017-07-04 17:19:15 · 1413 阅读 · 0 评论 -
畅通工程续
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 63560 Accepted Submission(s): 23878Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次...原创 2018-04-03 22:30:02 · 182 阅读 · 1 评论 -
UVA - 12661(加条件的最短路)
There is a funny car racing in a city with n junctions and m directed roads.The funny part is: each road is open and closed periodically. Each road is associate with twointegers (a, b), that means the...原创 2018-04-27 21:24:11 · 183 阅读 · 0 评论