Ориентированный граф через списки смежности

unit uMain;
 
interface
 
uses
  Winapi.Windows, Winapi.Messages, System.SysUtils, System.Variants, System.Classes, Vcl.Graphics,
  Vcl.Controls, Vcl.Forms, Vcl.Dialogs;
 
type TadjencyListElement=^AdjencyListElement;
 
   AdjencyListElement=record
 
   vertex:integer; // number of adjency vertex
   weight:integer;
   next:TadjencyListElement; // pointer to next vertex
 
end;
 
 
type
  TMain = class(TForm)
  private
    { Private declarations }
 
    procedure addEdge(AVertex1, AVertex2:integer);
 
  public
    { Public declarations }
  end;
 
const N=10;
var
  Main: TMain;
  Graph:Array [1..N] of TadjencyListElement;
 
implementation
 
{$R *.dfm}
 
{ TMain }
 
procedure TMain.addEdge(AVertex1, AVertex2:integer);
 
var newAdjencyListElement:TadjencyListElement;
      tempAdjencyListElement:TadjencyListElement;
 
begin
 
// will insert edge beetwen vertex 1 and 2
 
 if Graph[AVertex1]<>nil then begin // if TadjencyListElementin in vertex1 already exists , add to the end of adjency list
 
 
  New(newAdjencyListElement);
  newAdjencyListElement.Vertex:=AVertex2;
  newAdjencyListElement.next:=nil;
 
  tempAdjencyListElement:=Graph[AVertex1];
  while tempAdjencyListElement^.Next<>nil do
  tempAdjencyListElement:=tempAdjencyListElement^.next; // now tempAdjencyListElement is the last in adjency list
 
  tempAdjencyListElement^:=newAdjencyListElement; // now it points to the last added adjency element
 
 end else
 
 begin  // creating first new element of adjency list
 
    New(newAdjencyListElement);
    newAdjencyListElement^.Vertex:=AVertex2;
    newAdjencyListElement^.next:=nil;
 
 end;
 
 
end;
 
 
 
end.

procedure TMain.clearMemory;
var
  i: Integer;
begin
 for i := 0 to High(Graph) do if Graph[i]<>nil then  Dispose(TadjencyListElement(Graph[i]));
end;

TNode = class
  ID:integer;
end;
TEdge = class
  Node1,Node2:TNode;
  weight:integer;
end;
TNodeList=class(TObjectList<TNode>)
end;
TEdgeList=class(TObjectList<TEdge>)
end;

nodes:=TNodeList.Create;
edges:=TEdgeList.Create;

node:=TNodeList.Create();
node.ID:=nodes.Count;
nodes.Add(Node);
node:=TNodeList.Create();
node.ID:=nodes.Count;
nodes.Add(Node);
 
edge:=TEdge.Create;
edge.node1:=nodes[0];
edge.node2:=nodes[1];
edges.add(Edge);

edges.free;
nodes.free;

node:=TNodeList

node:=TNode.Create