Fix the tests

Author: amontoison

src/coloring.jl

@@ -339,9 +339,9 @@ function _grow_star!(
     if p != v  # a neighbor of v with color[w] encountered for the first time
         first_neighbor[color[w]] = (v, w, index_vw)
     else  # merge T_{vw} with a two-colored star being grown around v
-        root1 = find_root!(forest, index_vw)
-        root2 = find_root!(forest, index_pq)
-        root_union!(forest, root1, root2)
+        root_vw = find_root!(forest, index_vw)
+        root_pq = find_root!(forest, index_pq)
+        root_union!(forest, root_vw, root_pq)
     end
     return nothing
 end
@@ -356,10 +356,10 @@ function _merge_trees!(
     # modified
     forest::Forest{<:Integer},
 )
-    root1 = find_root!(forest, index_vw)
-    root2 = find_root!(forest, index_wx)
-    if root1 != root2
-        root_union!(forest, root1, root2)
+    root_vw = find_root!(forest, index_vw)
+    root_wx = find_root!(forest, index_wx)
+    if root_vw != root_wx
+        root_union!(forest, root_vw, root_wx)
     end
     return nothing
 end
@@ -482,7 +482,11 @@ function TreeSet(
 
     # nvmax is the number of vertices in the largest tree of the forest
     # In a tree, the number of vertices is equal to the number of edges plus one
-    nvmax = maximum(num_edges_per_tree) + 1
+    nvmax = zero(T)
+    for ne_tree in num_edges_per_tree
+        nvmax = max(nvmax, ne_tree)
+    end
+    nvmax = nvmax + 1
 
     # Create a queue with a fixed size nvmax
     queue = Vector{T}(undef, nvmax)

test/allocations.jl

@@ -154,11 +154,7 @@ end
             b64 = @b fast_coloring(A64, problem, algo)
             b32 = @b fast_coloring(A32, problem, algo)
             # check that we allocate no more than 50% + epsilon with Int32
-            if decompression == :direct
-                @test b32.bytes < 0.6 * b64.bytes
-            else
-                @test_broken b32.bytes < 0.6 * b64.bytes
-            end
+            @test b32.bytes < 0.6 * b64.bytes
         end
     end
 end;