Cod sursa(job #455828)

Utilizator valytgjiu91stancu vlad valytgjiu91 Data 14 mai 2010 11:53:43
Problema Algoritmul lui Dijkstra Scor 0
Compilator fpc Status done
Runda Arhiva educationala Marime 0.26 kb
Raporteaza aceasta sursa 
for i:=2 to n do
   if d[i]=0 then d[i]:=inf;
repeat
   ok:=true;
   for i:=1 to m do
      if d[g[i].y]>(d[g[i].x]+g[i].cost) then
             begin
               d[g[i].y]:=d[g[i].x]+g[i].cost;
               ok:=false;
             end;
   until ok;