Cod sursa(job #1979739)

Utilizator Sergiu.VictorTalmacel Sergiu Victor Sergiu.Victor Data 11 mai 2017 11:28:33
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.15 kb
#include <iostream>
#define inf 1000
#include <fstream>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int a[101][101],n,p,d[101],pred[101],viz[101];
void Citire()
{
    fin>>n>>p;
    int x,y,c;
    while(fin>>x>>y>>c) a[x][y]=c;
}
void Dijkstra(int x)
{
    int vmin,poz, ok=1;
    for(int i=1;i<=n;i++)
    {
        if(a[x][i]!=0 && a[x][i]!=inf) d[i]=a[x][i];
        else if(i==x) d[i]=0;
              else d[i]=inf;

        pred[i]=x;

    }
    viz[x]=1;
    pred[x]=0;
    while(ok)
    {
        int mini= inf;
        for(int i=1;i<=n;i++)
            if(!viz[i] && mini >d[i])
        {
            mini=d[i];
            x=i;
        }
        viz[x]=1;
        if(mini!=inf)
        {


            for(int i=1;i<=n;i++)
                if(!viz[i] && a[x][i] && d[x] +a[x][i]<d[i])
            {
                d[i]=d[x]+a[x][i];
                pred[i]=x;
            }
        }
        else ok=0;


    }

}
int main()
{
    Citire();
    Dijkstra(p);
    for(int i=1;i<=n;i++)
        if(d[i]==inf) fout<<-1<<" ";
        else fout<<d[i]<<" ";
    return 0;
}