anchor.diff:      //Distances[i,i] := High(Integer);
       Used[I] := False;
     end;
  -
     for i := 1 to (Length(Points) - Length(Result)) do
     begin
       min_dist_overall := High(Integer);
  
positive.code:   S,Count: TInteger2Array;
    P: TSingle2Array;
    PointsArr: TKMPoint2Array;
  
    procedure MakeNewQueue;
    begin
        new(StartQueue);
        EndQueue := StartQueue;
    end;
  
    procedure InsertInQueue(X,Y: Integer; Probability: Single);
    begin
        EndQueue^.X := X;
  
negative.code:     if counter = cnt then
        break;
    end;
  end;
  //}
  
  