Cod sursa(job #1226811)

Utilizator TudorMTudor Moldovanu TudorM Data 8 septembrie 2014 10:57:10
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
#include<fstream>
#include<cstring>
#define inf 1000000000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n, m, d[50001], t[50001], a[1300][1300];
bool viz[50001];
void citire()
{
    int i, j, x, y, c;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)a[i][j]=inf;
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        a[x][y]=c;
    }
}
void dijkstra()
{
    int i, j, mini, ok1=1, x, poz;
    viz[1]=1;
    x=1;
    for(i=2;i<=n;i++)
    {
        d[i]=inf;
        t[i]=x;
    }
    while(ok1)
    {
        mini=inf;
        for(i=1;i<=n;i++)
        {
            if(!viz[i]&&d[i]==inf&&a[x][i]!=inf)
            {
                d[i]=d[x]+a[x][i];
                t[i]=x;
            }
        }
        for(i=1;i<=n;i++)
        {
            if(d[i]<mini&&!viz[i])
            {
                mini=d[i];
                poz=i;
            }
        }
        x=poz;
        viz[x]=1;
        if(mini==inf)ok1=0;
    }
}
int main()
{
    citire();
    dijkstra();
    int i;
    for(i=2;i<=n;i++)
    {
        if(d[i]!=inf)g<<d[i]<<" ";
        else g<<0<<" ";
    }
    f.close();
    g.close();
    return 0;
}