Cod sursa(job #1886063)

Utilizator leraValeria lera Data 20 februarie 2017 17:05:43
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <fstream>
#define inf 999999999
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int mat[5005][5005],a,b,c,cost[5005],nod,rez,viz[5005],n,m,nod2;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)mat[i][j]=-1;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        mat[a][b]=c;
    }
    for(int i=1;i<=n;i++)cost[i]=inf;
    cost[1]=0;
    nod=1;
    for(int j=1;j<=n;j++)
    {
        viz[nod]=1;
        for(int i=1;i<=n;i++)if(mat[nod][i]!=-1)cost[i]=min(cost[nod]+mat[nod][i],cost[i]);
        for(int i=1;i<=n;i++)
        {
            rez=inf;
            if(!viz[i] && cost[i]<rez)
            {
                nod2=i;
                rez=cost[i];
            }
        }
        nod=nod2;
    }
    for(int i=2;i<=n;i++)fout<<cost[i]<<" ";
    return 0;
}