Cod sursa(job #247521)

Utilizator hasegandaniHasegan Daniel hasegandani Data 23 ianuarie 2009 10:18:53
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<stdio.h>

#define nmax 100

/*struct nod
{
    int varf;
    int drum;
    nod *adr;
};

nod *list[nmax];*/
int d[nmax],s[nmax],t[nmax],a[nmax][nmax];
//void add(nod *&,int,int);

int main()
{
    int a,b,x,m,n;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=2;i<=n;i++)
        d[i]=50000000;
    for(;m;m--)
        {
            scanf("%d%d%d",&a,&b,&x);
            add(list[a],b,x);
            if (a==1)
                d[b]=x;
        }
        
    for(int i=2;i<=n;++i)
        {

        }
    return 0;
}

/*void add(nod *&a,b,x)
{
    nod *p=new nod;
    p->varf=b;
    p->drum=x;
    if (a)
            p->adr=a;
    else
            p->adr=0;
    a=p;
}*/