Ориентированные графы

const 
  MaxN = 100;
var 
  N : Integer;
  G : array [1 .. MaxN,1 .. MaxN] of Integer;
  V : array [1 .. MaxN,1 .. MaxN] of Longint;
procedure Floyd;
var 
  I,J,K : Integer;
begin 
  for I:=1 to N do
  for J:=1 to N do
    V[I,J] := G[I,J];
  for I:=1 to N do
    V[I,I] := 0;
  for J:=1 to N do
 for I:=1 to N do
 for K:=1 to N do
    if (V[I,J]<>-1) and (V[J,K]<>-1) and 
    ((V[I,K]=-1) or (V[I,K]>V[I,J]+V[J,K])) then
      V[I,K] := V[I,J] + V[J,K];
end;

type
Graph = array[1..nn,1..nn] of integer;
 
Procedure Floyd(var a, p: graph);
var i,j,k:integer;
c: graph;
 
begin
//A - матрица содержащая кратчайшие пути.
//P - матрица, сохраняющая маршруты.
Randomize;
for i:=1 to nn do
for j:=1 to nn do
c[i,j] := random(100);
for i:=1 to nn do
for j:=1 to nn do
begin
if Terminated then exit;
Synchronize(UpdateProgress);
a[i,j]:=c[i,j];
p[i,j]:=0;
end;
for i:=1 to nn do a[i,i]:=0;
for k:=1 to nn do
for i:=1 to nn do
for j:=1 to nn do
if (a[i,k]+a[k,j] < a) then
begin
if Terminated then exit;
a[i,j]:=a[i,k]+a[k,j];
p[i,j]:=k;
end;
end;