最短路 Bellman-Ford+负圈判断 模板

typedef long long LL;
const LL INF = 0x3f3f3f3f;
struct edge
{
	int from, to, cost;
}es[30010]; //边
int d[30010]; //源点到下标为i的点的最短距离
int V, E;  //顶点数和边数
void Bellman_Ford(int s)
{
	for (int i = 0; i < V; i++) d[i] = INF;
	d[s] = 0;
	while (1)
	{
		bool update = false;
		for (int i = 0; i < E; i++)
		{
			edge e = es[i];
			if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost)
			{
				d[e.to] = d[e.from] + e.cost;
				update = true;
			}
		}
		if (!update) break;
	}
}

bool find_negative_loop() //返回true则存在负圈
{
	memset(d, 0, sizeof(d));
	for (int i = 0; i < V; i++)
	{
		for (int j = 0; j < E; j++)
		{
			edge e = es[j];
			if (d[e.to] > d[e.from] + e.cost)
			{
				d[e.to] = d[e.from] + e.cost;
				if (i == V - 1) return true;
			}
		}
	}
	return false;
}