![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Floyd算法
Com_ice
这个作者很懒,什么都没留下…
展开
-
hdu 1217 Arbitrage
ArbitrageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8579 Accepted Submission(s): 3956Problem DescriptionArbitrage is the use原创 2017-08-20 23:08:10 · 282 阅读 · 0 评论 -
HDU 1599 find the mincost route(Floyd无向图最小环)
find the mincost routeTime Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5749 Accepted Submission(s): 2300Problem Description杭州有N个原创 2017-08-25 22:57:57 · 306 阅读 · 0 评论 -
HDU 1385 Minimum Transport Cost(Floyd+路径输出)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11367 Accepted Submission(s): 3176Problem DescriptionThese原创 2017-08-28 00:22:04 · 297 阅读 · 0 评论 -
HDU 1690 Bus System(Floyd)
Bus SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8999 Accepted Submission(s): 2444Problem DescriptionBecause of the huge原创 2017-08-23 22:10:51 · 226 阅读 · 0 评论 -
关于 Floyd的个人理解与总结
1.Floyd是用与求任意的两点的最短距离的算法,而dijstra算法是求已知一点到未知的一点的距离,或者是已知的两点的距离所以要分清这两种求最短路的算法的区别2.实现原理:map[a][b](a到b的距离)一定是它本身或者是当前的各个的最短路通过 k节点连接(map[i][k]+map[k][j])3.状态转移方程:map[i][j]=min(map[i][k]+map[k][j],ma原创 2018-01-05 00:17:43 · 543 阅读 · 0 评论 -
关于Floyd的打印路径的个人总结
如图这个最短路很明显要打印该条路的路径,需要这条路上的各个节点都能被枚举到,最简单的方式就是path[1][8]=5,path[5][8]=4,path[4][8]=7,path[7][8]=8;显然如果要满足以上的要求,当map[i][j]时path[i][j]=path[i][k]即可.举例:k=4 时path[5][7]=path[5][4]=4k=7 时path[5原创 2018-01-09 14:03:12 · 1851 阅读 · 0 评论 -
HDU6080 百度之星资格赛1001 度度熊保护村庄
度度熊保护村庄Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 249 Accepted Submission(s): 99Problem Description哗啦啦村袭击了喵哈哈村!度度熊为了拯救喵哈原创 2017-08-18 16:09:39 · 656 阅读 · 0 评论