Mai intai trebuie sa te autentifici.

Cod sursa(job #1536084)

Utilizator binicBinica Nicolae binic Data 25 noiembrie 2015 17:43:37
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include<cstdio>
#define inf (1<<30)
using namespace std;
int ;

struct nod
{
    int val,cost;
    nod *urm;
}*v[50004];

void add(nod *&x, int y, int cost)
{
    nod *p;
    p=new nod;
    p->urm=x;
    p->val=y;
    p->cost=cost;
    x=p;
}

void Dijkstra(int x)
{
    int l=1;
    for(i=1;i<=l;i++)
    {
        for()
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&c)
        add(v[x],y,c);
        add(v[y],x,c);
    }
    for(i=1;i<=n;i++)
        c[i]=inf;
    Dijkstra(1);
    for(i=2;i<=n;i++)
    {
        if()
        printf("%d ",c[i]);
    }
    return 0;
}