Pagini recente » Cod sursa (job #2175677) | Cod sursa (job #2233773) | Cod sursa (job #2122806) | Cod sursa (job #476697) | Cod sursa (job #1610101)
#include <cstdio>
#include <climits>
#include <vector>
#define inf INT_MAX
#define po 50001
using namespace std;
int n,m,coada[250001],dist[po];
vector<pair<int,int> > nods[po];
FILE *f1;
int main()
{
f1=fopen("bellmanford.in","r");
fscanf(f1,"%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int a,b,c;
fscanf(f1,"%d%d%d",&a,&b,&c);
nods[a].push_back(make_pair(b,c));
}
for(int i=1;i<=n;i++)
{
dist[i]=inf;
}
dist[1]=0;
int p=1,u=1;
coada[p]=1;
while(p<=u)
{
int a=coada[p];
vector<pair<int,int> > ::iterator it;
for(it=nods[a].begin();it!=nods[a].end();it++)
{
if(dist[it->first]>dist[a]+it->second)
{
dist[it->first]=dist[a]+it->second;
coada[++u]=it->first;
}
}
p++;
}
FILE *f=fopen("bellmanford.out","w");
for(int i=2;i<=n;i++)
{
fprintf(f,"%d ",dist[i]);
}
return 0;
}