Remove coloring tests

Author: blegat

test/ReverseAD.jl

@@ -413,71 +413,6 @@ struct _ColoringGraph
     edges::Vector{Tuple{Int,Int}}
 end
 
-# Tests for internal Coloring submodule removed - now using SparseMatrixColorings
-# The coloring functionality is tested indirectly through the Hessian evaluation tests
-
-# function to_adjlist(graph::_ColoringGraph)
-#     I = [i for (i, _) in graph.edges]
-#     J = [j for (_, j) in graph.edges]
-#     return Coloring.UndirectedGraph(I, J, graph.num_vertices)
-# end
-
-# function test_coloring_edge_free_graph()
-#     graph = _ColoringGraph(10, [])
-#     _, numcolors = Coloring.acyclic_coloring(to_adjlist(graph))
-#     @test numcolors == 1
-#     return
-# end
-
-# function test_coloring_one_edge_graph()
-#     graph = _ColoringGraph(10, [(2, 4)])
-#     color, numcolors = Coloring.acyclic_coloring(to_adjlist(graph))
-#     @test numcolors == 2
-#     @test color[2] != color[4]
-#     return
-# end
-
-# function test_coloring_two_edge_graph()
-#     graph = _ColoringGraph(10, [(2, 4), (2, 3)])
-#     color, numcolors = Coloring.acyclic_coloring(to_adjlist(graph))
-#     @test numcolors == 2
-#     @test color[3] == color[4]
-#     return
-# end
-
-# function test_coloring_three_edge_graph()
-#     graph = _ColoringGraph(10, [(2, 4), (2, 3), (3, 4)])
-#     color, numcolors = Coloring.acyclic_coloring(to_adjlist(graph))
-#     @test numcolors == 3
-#     # TODO: What is this testing?
-#     Coloring.recovery_preprocess(to_adjlist(graph), color, numcolors, Int[])
-#     return
-# end
-
-# function test_coloring_two_edge_three_vertex_graph()
-#     graph = _ColoringGraph(3, [(1, 3), (2, 3)])
-#     _, numcolors = Coloring.acyclic_coloring(to_adjlist(graph))
-#     @test numcolors == 2
-#     return
-# end
-
-# function test_coloring_four_edge_four_vertex_graph()
-#     graph = _ColoringGraph(4, [(1, 2), (2, 3), (3, 4), (4, 1)])
-#     _, numcolors = Coloring.acyclic_coloring(to_adjlist(graph))
-#     @test numcolors == 3
-#     return
-# end
-
-# function test_coloring_topological_sort()
-#     # graph = _ColoringGraph(6, [(1, 2), (1, 3), (1, 6), (2, 4), (2, 5)])
-#     vec = [3, 6, 2, 1, 4, 5, 1, 2, 2, 1]
-#     offset = [1, 4, 7, 8, 9, 10, 11]
-#     v = Coloring.reverse_topological_sort_by_dfs(vec, offset, 6, zeros(Int, 6))
-#     @test v[1] == [3, 6, 4, 5, 2, 1]
-#     @test v[2] == [0, 1, 1, 2, 2, 1]
-#     return
-# end
-
 function test_coloring_end_to_end_hessian_coloring_and_recovery()
     # Test the new coloring API through the compatibility layer
     coloring_algorithm =