#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510, M = 10010;
int n, m, k;
int dist[N], backup[N];
struct Edge
{
int a, b, w;
}edges[M];
int bellman_ford()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
for (int i = 0; i < k; i ++ )
{
memcpy(backup, dist, sizeof dist);
for (int j = 0; j < m; j ++ )
{
int a = edges[j].a, b = edges[j].b, w = edges[j].w;
dist[b] = min(dist[b], backup[a] + w);
}
}
if (dist[n] > 0x3f3f3f3f >> 1) return -0x3f3f3f3f;
return dist[n];
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < m; i ++ )
{
int a, b, w;
scanf("%d%d%d", &a, &b, &w);
edges[i] = {a, b, w};
}
int t = bellman_ford();
if (t == -0x3f3f3f3f) puts("impossible");
else printf("%d\n", t);
return 0;
}
有边数限制的最短路
最新推荐文章于 2024-10-17 22:45:33 发布
这段代码实现了一个C++程序,运用Bellman-Ford算法来寻找给定负权重边的图中从源点到目标点的最短路径。程序读取图的节点数、边数和迭代次数,然后计算最短路径。如果存在负权回路,则返回不可能表示无法找到最短路径。
摘要由CSDN通过智能技术生成