Switch to a more efficient list implementation

DanielPointon · Feb 7, 2024 · 3c78227 · 3c78227
1 parent 4626066
commit 3c78227
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/gap/oper.gi b/gap/oper.gi
@@ -2034,15 +2034,15 @@ function(D, roots)
   od;
 
   graph_out_neighbors := OutNeighbors(D);
-  queue := ListWithIdenticalEntries(N, -1);
+  queue := EmptyPlist(N);
   queue_tail := 0;
   for root in roots do
     queue_tail := queue_tail + 1;
     queue[queue_tail] := root;
   od;
 
   index := 1;
-  while index <= Length(queue) and queue[index] > 0 do
+  while IsBound(queue[index]) do
     element := queue[index];
     node_neighbours := graph_out_neighbors[element];
     for neighbour in node_neighbours do