Pagini recente » Cod sursa (job #2498651) | Cod sursa (job #2558676) | Cod sursa (job #1360669) | Cod sursa (job #1152635) | Cod sursa (job #807998)
Cod sursa(job #807998)
#include <fstream>
#include <vector>
#define INF 2000000000
using namespace std;
int n, m;
int d[50010];
struct muchie
{
int x, y, cost;
};
vector <muchie> a;
inline void Read()
{
ifstream f("bellmanford.in");
f>>n>>m;
int i;
muchie aux;
for(i=1; i<=m; i++)
{
f>>aux.x>>aux.y>>aux.cost;
a.push_back(aux);
}
f.close();
}
inline bool BellmanFord()
{
vector <muchie>::iterator it, final;
muchie aux;
for(int i=2; i<=n; i++)
d[i] = INF;
for(int i=1; i<n; i++)
{
it = a.begin();
final = a.end();
for(; it!=final; it++)
{
aux = *it;
if(d[aux.y] > d[aux.x] + aux.cost)
{
d[aux.y] = d[aux.x] + aux.cost;
}
}
}
for(it = a.begin(), final = a.end(); it!=final; it++)
{
aux = *it;
if(d[aux.y] > d[aux.x] + aux.cost)
return true;
}
return false;
}
inline void Write(bool ciclu)
{
ofstream g("bellmanford.out");
if(ciclu)
g<<"Ciclu negativ!\n";
else
{
for(int i=2; i<=n; i++)
g<<d[i]<<" ";
g<<"\n";
}
g.close();
}
int main()
{
Read();
bool ciclu;
ciclu = BellmanFord();
Write(ciclu);
return 0;
}