单源最短路径Bellman_Ford, 边带负权值, 最短路径条数 c++模板

最新推荐文章于 2023-11-01 15:19:15 发布

马正气

最新推荐文章于 2023-11-01 15:19:15 发布

阅读量220

点赞数

分类专栏：算法#最短路径文章标签：算法

本文链接：https://blog.csdn.net/zzzhengqi/article/details/105445924

版权

算法#最短路径专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define MAXN 510
struct Edge {
	int next;
	int cost;
	Edge(int nn, int cc) {
		next = nn;
		cost = cc;
	}
};
vector<Edge> graph[MAXN];
int weight[MAXN];

int d[MAXN], w[MAXN];

set<int> pre[MAXN];
int num[MAXN];

bool Bellman_Ford(int n, int c1) {
	for (int i = 0; i < n; i++) {
		d[i] = 1 << 30;
		w[i] = 0;
		num[i] = 0;
	}
	d[c1] = 0;
	w[c1] = weight[c1];
	num[c1] = 1;
	for (int i = 1; i < n; i++) { //n - 1轮
		for (int j = 0; j < n; j++) { //每轮遍历所有边
			for (int k = 0; k < graph[j].size(); k++) {
				int next = graph[j][k].next;
				int cost = graph[j][k].cost;
				if (d[next] > d[j] + cost) {
					d[next] = d[j] + cost;
					w[next] = w[j] + weight[next];
					num[next] = num[j];
					pre[next].clear();
					pre[next].insert(j);
				}
				else if (d[next] == d[j] + cost) {
					if (w[next] < w[j] + weight[next])
						w[next] = w[j] + weight[next];
					if (pre[next].find(j) == pre[next].end()) {
						pre[next].insert(j);
						num[next] += num[j];
					}
				}
			}
		}
	}
	for (int j = 0; j < n; j++) { //判断负环
		for (int k = 0; k < graph[j].size(); k++) {
			int next = graph[j][k].next;
			int cost = graph[j][k].cost;
			if (d[next] > d[j] + cost)
				return false;
		}
	}
	return true;
}