Cod sursa(job #698108)

Utilizator mada0222Tomus Madalina mada0222 Data 29 februarie 2012 12:26:20
Problema Algoritmul Bellman-Ford Scor 100
Compilator fpc Status done
Runda Arhiva educationala Marime 1.57 kb
program sss;
type e=record
     nod,cost:longint;
     end;
var n,m,x,y,z,i,pi,ps,j,nr,wnod,wcost:longint;
    f,g:text;
    q,d,viz:array[1..1000000] of longint;
    ok:boolean;
    a:array of array of e;
begin
assign(f,'bellmanford.in'); reset(f);
assign(g,'bellmanford.out'); rewrite(g);
  readln(f,n,m);
  setlength(a,n+1,1);
    for i:=1 to m do
      begin
        readln(f,x,y,z);
        setlength(a[x],length(a[x])+1);
        a[x,0].nod:=a[x,0].nod+1;
        a[x,a[x,0].nod].nod:=y;
        a[x,a[x,0].nod].cost:=z;
      end;
    pi:=1;
    ps:=1;
    q[pi]:=1;
    d[1]:=0;
      for i:=2 to n do
        d[i]:=maxint;
          while ps<=pi do
             begin
             nr:=q[ps];
             ps:=ps+1;
             viz[nr]:=viz[nr]+1;
               for i:=1 to a[nr,0].nod do
                  begin
                  wnod:=a[nr,i].nod;
                  wcost:=a[nr,i].cost;
                    if d[wnod]>d[nr]+wcost then
                      begin
                      d[wnod]:=d[nr]+wcost;
                      pi:=pi+1;
                      q[pi]:=wnod;;
                      viz[wnod]:=viz[wnod]+1;
                        if viz[wnod]>n then
                          begin
                          write(g,'Ciclu negativ!');
                          close(f);
                          close(g);
                          exit;
                          end;
                      end;
                  end;
             end;
          for i:=2 to n do
            write(g,d[i],' ');
close(f);
close(g);
end.