Cod sursa(job #1319789)

Utilizator IoanaMarMarussi Ioana IoanaMar Data 17 ianuarie 2015 13:33:17
Problema Algoritmul lui Dijkstra Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 1.26 kb
#include <stdio.h>
#include <stdlib.h>

#define INF 999999999

int c[5000][5000],n,m,d[50000],t[50000],minim,k,sel[50000];
FILE *f,*g;


void dij(int p)
{
    int i,j;
    int ok;
    for(i=1;i<=n;i++)
    {
        t[i]=0;
        d[i]=INF; sel[i]=0;

    }
    d[p]=0;
    t[p]=0;
    ok=1;
    for(i=1; i<=n && ok; i++)
    {
        minim=INF;
        for(j=1;j<=n;j++)
            if(d[j] < minim && !sel[j])
            {
                minim = d[j];
                k = j;
            }
        if(minim==INF)
            ok=0;
        else{
            sel[k]=1;
            for(j=1;j<=n;j++)
                if(d[j]>d[k]+c[k][j]&& !sel[j])
                    {d[j]=d[k]+c[k][j];
                     t[j]=k;
                    }
        }
    }
}

int main()
{
    f = fopen("in.txt","r");
    g = fopen("out.txt","w");
    int i,j,x,y,z;
    fscanf(f,"%d %d", &n, &m);
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++)
            c[i][j]=INF;
         c[i][i]=0;
    }

    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d %d %d",&x,&y,&z);
        c[x][y]=z;
    }
    dij(1);
    for(i=2;i<=n;i++)
        if (d[i]==INF)
            d[i]=0;
    for (i=2; i<=n; i++)
         fprintf(g,"%d ",d[i]);
    return 0;
}