anchor.diff:        ActIdx := fQueueArray[ActIdx].Next;
         I := I + 1;
       end;
  -
  +    // Change indexes of surrounding elements (= insert element into queue, no shift of other elements is required)
       if (I = 0) then
       begin
         fQueueArray[aIdx].Next := fStartQueue;
  
positive.code: uses
    KM_AIFields, KM_NavMesh;
  
  { TNavMeshPathFinding }
  constructor TNavMeshFloodFill.Create(aSorted: Boolean = False);
  begin
  
negative.code: var
    I, ActIdx, PrevIdx: Word;
  begin
    // Empty queue
    if IsQueueEmpty then
    begin
      fStartQueue := aIdx;
      fEndQueue := fStartQueue;
    end
    // Insert in sorted array
    else
    begin
      PrevIdx := fStartQueue;
      ActIdx := fStartQueue;
      // Find the right position
      I := 0;
      while (I < fQueueCnt) do // While must be here
      begin
  