Cod sursa(job #2164546)

Utilizator SternulStern Cristian Sternul Data 13 martie 2018 06:31:45
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
#include <iostream>
#include <fstream>
#include <limits>
#define NMAX 10000
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int a[NMAX][NMAX], n, m, inf = 2147483644;

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

void dijkstra(int x0)
{
    int i, j, min, k;
    bool ok;
    int viz[NMAX], tata[NMAX], d[NMAX];
    for(int i = 1;i <= n;i++)
    {
        d[i]=a[x0][i];
        tata[i] = x0;
        viz[i] = 0;
    }
    tata[x0] = 0;
    viz[x0] = 1;
    ok = 1;
    while(ok)
    {
        min = inf;
        for(i = 1;i <= n;i++)
            if(!viz[i] && min>d[i])
            {
                min = d[i];
                k = i;
            }
        if(min != inf){
            viz[k] = 1;
            for(i = 1;i <= n;i++)
                if(!viz[i] && d[i] > d[k] + a[k][i]){
                    d[i] = d[k] + a[k][i];
                    tata[i] = k;
                }
        }
        else ok = 0;
    }
    for(int i =2 ;i<=n;i++)
        g<<d[i]<<" ";
}


int main()
{
    citire();
    dijkstra(1);

}