18 Bellman-Ford算法

#include <iostream>
using namespace std;
const int maxnum = 100;
const int maxint = 99999;
 
// 边
typedef struct Edge{
	int u, v;    // 起点，终点
	int weight;  // 边的权值
}Edge;
 
Edge edge[maxnum];     // 保存边的值
int  dist[maxnum];     // 结点到源点最小距离
 
int nodenum, edgenum, source;    // 结点数，边数，源点
 
// 初始化图
void init()
{
	// 输入结点数，边数，源点
	cout<<"please input nodenum, edgenum and source:"<<endl;
	cin >> nodenum >> edgenum >> source;
	for(int i=1; i<=nodenum; ++i)
		dist[i] = maxint;
	dist[source] = 0;
	for(int i=1; i<=edgenum; ++i)
	{
		cout<<"please input u, v and weight:"<<endl;
		cin >> edge[i].u >> edge[i].v >> edge[i].weight;
	}
}
 
// 松弛计算
void relax(int u, int v, int weight)
{
	if(dist[v] > dist[u] + weight)
		dist[v] = dist[u] + weight;
}
 
bool Bellman_Ford()
{
	for(int i=1; i<=nodenum-1; ++i)
		for(int j=1; j<=edgenum; ++j)
			relax(edge[j].u, edge[j].v, edge[j].weight);
	bool flag = 1;
	// 判断是否有负环路
	for(int i=1; i<=edgenum; ++i)
		if(dist[edge[i].v] > dist[edge[i].u] + edge[i].weight)
		{
			flag = 0;
			break;
		}
	return flag;
}
int main()
{
	init();
	if(Bellman_Ford())
	{
		cout<<"result is:"<<endl<<endl;
		for(int i = 1 ;i <= nodenum; i++)
			cout << dist[i] << endl;
	}
	else
		cout<<"there is a negtive circle!"<<endl;
	return 0;
}