Cod sursa(job #2167723)

Utilizator dragos99Homner Dragos dragos99 Data 13 martie 2018 23:06:29
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.26 kb
#include<fstream>
#define inf 999999
using namespace std;
    ifstream f("data.in");
    ofstream g("data.out");
long n,m;
long a[1000][1000],viz[1000],d[1000],t[1000];

void citire()
{
    long x,y,c;
    f>>n>>m;
    for(long i=1;i<=n;i++)
    {
        f>>x>>y>>c;
        a[x][y]=c;
    }
    for(long i=1;i<=n;i++)
        for(long j=1;j<=n;j++)
            if(!a[i][j])
                a[i][j]=inf;
}

long k_min()
{
    long i,mi=inf,poz=0;
    for(i=1;i<=n;i++)
        if(!viz[i] && d[i]<mi)
            {mi=d[i];
            poz=i;}
    return poz;
}

void dijkstra()
{
    long i,j,k;
    viz[1]=1; t[1]=0;
    for(i=1;i<=n;i++)
        d[i]=inf;
    for(i=1;i<=n;i++)
        if(a[1][i])
            {
                d[i]=a[1][i];
                t[i]=1;
            }
    for(j=1;j<n;j++)
        {
            k=k_min();
            if(k){
            viz[k]=1;
            for(i=2;i<=n;i++)
                if(i!=k && d[i]>d[k]+a[k][i])
                    {
                        d[i]=d[k]+a[k][i];
                        t[i]=k;
                    }
            }
        }
}

void tipar()
{
    for(long i=2;i<=n;i++)
        g<<d[i]<<" ";
}

int main()
{
citire();
dijkstra();
tipar();
return 0;
}