Pagini recente » Cod sursa (job #1579037) | Cod sursa (job #1330745) | Cod sursa (job #2524869) | Cod sursa (job #482932) | Cod sursa (job #405693)
Cod sursa(job #405693)
#include<fstream>
#include<vector>
using namespace std;
#define nmax 50005
#define pb push_back
#define inf 1<<30
vector<int> g[nmax],c[nmax];
int d[nmax],s[nmax];
int n,m;
void citire ()
{
ifstream fin("dijkstra.in");
fin>>n>>m;
int i,a,b,cost;
for(i=1;i<=m;i++)
{
fin>>a>>b>>cost;
g[a].pb(b);c[a].pb(cost);
}
fin.close();
}
void bellmanford(int nod)
{
int sf,inc,x,i;
for(i=1;i<=n;i++)
d[i]=inf;
s[inc=sf=0]=nod;
d[nod]=0;
while(inc<=sf)
{
x=s[inc];
inc++;
for(i=0;i<g[x].size();i++)
if(d[g[x][i]]>d[x]+c[x][i])
d[g[x][i]]=d[x]+c[x][i],s[++sf]=g[x][i];
}
}
void scrie ()
{
int i;
ofstream fout("dijkstra.out");
for(i=2;i<=n;i++)
if(d[i]==inf) fout<<0;
else fout<<d[i]<<' ';
fout.close();
}
int main ()
{
citire ();
bellmanford(1);
scrie ();
return 0;
}