More tests

Author: gdalle

src/structured.jl

@@ -70,7 +70,7 @@ function coloring(
     algo::GreedyColoringAlgorithm;
     kwargs...,
 )
-    color = cycle_range(1:2, size(A, 2))
+    color = cycle_range(2, size(A, 2))
     bg = BipartiteGraph(A)
     return ColumnColoringResult(A, bg, color)
 end
@@ -81,7 +81,7 @@ function coloring(
     algo::GreedyColoringAlgorithm;
     kwargs...,
 )
-    color = cycle_range(1:2, size(A, 1))
+    color = cycle_range(2, size(A, 1))
     bg = BipartiteGraph(A)
     return RowColoringResult(A, bg, color)
 end
@@ -126,7 +126,7 @@ function coloring(
     algo::GreedyColoringAlgorithm;
     kwargs...,
 )
-    color = cycle_range(1:3, size(A, 2))
+    color = cycle_range(3, size(A, 2))
     bg = BipartiteGraph(A)
     return ColumnColoringResult(A, bg, color)
 end
@@ -137,7 +137,7 @@ function coloring(
     algo::GreedyColoringAlgorithm;
     kwargs...,
 )
-    color = cycle_range(1:3, size(A, 1))
+    color = cycle_range(3, size(A, 1))
     bg = BipartiteGraph(A)
     return RowColoringResult(A, bg, color)
 end

test/structured.jl

@@ -26,12 +26,16 @@ end
         result = coloring(A, column_problem, algo)
         B = compress(A, result)
         @test size(B, 2) == 1
-        @test decompress(B, result) == A
+        D = decompress(B, result)
+        @test D == A
+        @test D isa Diagonal
         # row
         result = coloring(A, row_problem, algo)
         B = compress(A, result)
         @test size(B, 1) == 1
-        @test decompress(B, result) == A
+        D = decompress(B, result)
+        @test D == A
+        @test D isa Diagonal
     end
 end
 
@@ -44,12 +48,16 @@ end
             result = coloring(A, column_problem, algo)
             B = compress(A, result)
             @test size(B, 2) == 2
-            @test decompress(B, result) == A
+            D = decompress(B, result)
+            @test D == A
+            @test D isa Bidiagonal
             # row
             result = coloring(A, row_problem, algo)
             B = compress(A, result)
             @test size(B, 1) == 2
-            @test decompress(B, result) == A
+            D = decompress(B, result)
+            @test D == A
+            @test D isa Bidiagonal
         end
     end
 end
@@ -63,12 +71,15 @@ end
             result = coloring(A, column_problem, algo)
             B = compress(A, result)
             @test size(B, 2) == min(n, 3)
-            @test decompress(B, result) == A
-            # row
+            D = decompress(B, result)
+            @test D == A
+            @test D isa Tridiagonal            # row
             result = coloring(A, row_problem, algo)
             B = compress(A, result)
             @test size(B, 1) == min(n, 3)
-            @test decompress(B, result) == A
+            D = decompress(B, result)
+            @test D == A
+            @test D isa Tridiagonal
         end
     end
 end