procedure Dijkstra; begin S := {1}; for i:=2 to n do begin D[i] := C[1,i]; P[i]:= 1 end; for i:=1 to n-1 do begin choose a vertex w in V-S such that D[w] is minimum; add w to S; for each vertex v in V-S do if D[v] > D[w] + C[w,v] then begin D[v] := D[w] + C[w,v]; P[v] := w end end end; procedure Floyd( var A: array[1..n, 1..n] of real; var P: array[1..n, 1..n] of integer; C: array[1..n, 1..n] of real); var ij,k: integer; begin for i:=1 to n do for j:=1 to n do begin A[i,j] := C[ij]; P[ij] := 0 end; for i:=1 to n do A[i,i] := 0; for k:=1 to n do for i:=1 to n do forj:=1 to n do if A[i,k]+A[kj]