Cod sursa(job #2577342)

Utilizator razvan1403razvan razvan1403 Data 9 martie 2020 06:44:05
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.12 kb
#include <bits/stdc++.h>
#define infinit INT_MAX
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int matrice[101][101],n,m;

void citire(int matrice[][101],int &n,int &m)
{
    int i,x,y,cost;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        matrice[x][y] = matrice[y][x] = cost;
    }
}
int viz[100],d[100];
void dijkstra(int nod_start)
{

    int i,pmin,mini,j;
    for(i=1;i<=n;i++)
        {
        viz[i] = 0;
        d[i] = matrice[nod_start][i] ? matrice[nod_start][i] : infinit;
        }
    viz[nod_start] = 1;
    d[nod_start] = 0;
    pmin=mini=0;
    for(i=1;i<=n-1;i++)
    {
        mini = infinit;
        for(j=1;j<=n;j++)
            if(d[j] < mini && viz[j] == 0)
            {
                mini = d[j];
                pmin = j;
            }
        viz[pmin] = 1;
        for(j=1;j<=n;j++)
            if(matrice[pmin][j] != 0 )
                if(d[j] > d[pmin] + matrice[pmin][j])
                    d[j] = d[pmin] + matrice[pmin][j];
    }
}

int main()
{
    citire(matrice,n,m);
    dijkstra(1);
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
}