![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Bellman_Ford
凌晨四点的洛杉矶fly
这个作者很懒,什么都没留下…
展开
-
Bellman_Ford算法
Bellman_Ford算法也是求单源最短路径的算法,但是它能算带负权边的图的最短路径(对于带负圈的图就无能为力),且可以判断当前图是否带有负圈。它的时间复杂度是O(n*m),其中n为点数,m为边数。 Bellman_Ford算法为什么能求得单源最短路径呢?其实他求解最短路径就是用的Dijkstra思想。因为它一共松弛n-1轮,每轮遍历了所有的边,所以它每轮至少要生成一个点的最...原创 2018-11-10 12:00:02 · 173 阅读 · 0 评论 -
spfa算法+dp
In some country there are exactly n cities and m bidirectional roads connecting the cities. Cities are numbered with integers from 1 to n. If cities a and b are connected by a road, then in an hour yo...原创 2019-01-25 17:59:14 · 173 阅读 · 0 评论 -
spfa求任意两点的最短距离
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define MAXN (3000+10)using names...原创 2019-01-25 18:00:03 · 262 阅读 · 0 评论