Cod sursa(job #731678)

Utilizator Adr3nal1nStefan Damian Adr3nal1n Data 8 aprilie 2012 20:55:34
Problema Algoritmul lui Dijkstra Scor 0
Compilator fpc Status done
Runda Arhiva educationala Marime 0.68 kb
var  c,i,j,k,n,m,a,b:longint;
        t:array[1..50000,1..50000] of longint;
        f:text;
procedure citire;
begin
assign(f,'dijkstra.in');
        reset(f);
        readln(f,n,m);
for i:=1 to m do
        begin
readln(f,a,b,c);
        t[a,b]:=c;
        t[b,a]:=c;
end;
end;
begin
citire;
for i:=1 to n do
       for k:=1 to n do
        for i:=1 to n do
        for j:=1 to n do
        if i<>j then
        if (t[k,i]+t[j,k]<t[i,j]) and (t[k,i]+t[j,k]<>0) then t[i,j]:=t[k,i]+t[j,k];
                     assign(f,'dijkstra.out');
                     rewrite(f);
                for j:=2 to n do
                write(f,t[1,j],' ');
                close(f);
end.