Pagini recente » Cod sursa (job #1487994) | Cod sursa (job #1082878) | Cod sursa (job #300907) | Cod sursa (job #2329444) | Cod sursa (job #2418008)
#include <fstream>
#include <vector>
#define INF 1000000000
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int main()
{
int n, m;
in >> n >> m;
struct edge
{
int x, y, c;
};
vector<edge> edges;
for(int i = 0; i < m; i++)
{
int x, y, c;
in >> x >> y >> c;
edge e = {x,y,c};
edges.push_back(e);
}
vector<int> d(n+1,INF);
d[1] = 0;
for(int i = 1; i < n; i++)
for(size_t j = 0; j < edges.size(); j++)
{
int x = edges[j].x;
int y = edges[j].y;
int c = edges[j].c;
if(d[x]+c < d[y]) d[y] = d[x]+c;
}
for(int i = 1; i <= n; i++)
for(size_t j = 0; j < edges.size(); j++)
{
int x = edges[j].x;
int y = edges[j].y;
int c = edges[j].c;
if(d[x]+c < d[y])
{
out << "Ciclu negativ!";
return 0;
}
}
for(int i = 2; i <= n; i++) out << d[i] << ' ';
return 0;
}