wip dbg cmember on ccolamd

Author: dehann

ext/IncrInfrApproxMinDegreeExt.jl

@@ -40,7 +40,9 @@ function _ccolamd!(
   for i in eachindex(p)
     p[i] -= 1
   end
-  err = AMD.ccolamd_l( # ccolamd_l
+  # BSD-3 clause, (c) Davis, Rajamanickam, Larimore
+  # https://github.com/DrTimothyAldenDavis/SuiteSparse/blob/f98e0f5a69acb6a3fb19703ff266100d43491935/LICENSE.txt#L153
+  err = AMD.ccolamd_l(
     n_row,
     n_col,
     Alen,

test/testCcolamdOrdering.jl

@@ -8,25 +8,24 @@ using Test
 
 fg = generateGraph_Kaess(graphinit=false)
 
+vo = getEliminationOrder(fg, constraints=[:x3], ordering=:ccolamd)
 
-try
-  vo = getEliminationOrder(fg, constraints=[:x3], ordering=:ccolamd)
+@test vo[end] == :x3
+@test length(vo) == length(ls(fg))
 
-  @test vo[end] == :x3
-  @test length(vo) == length(ls(fg))
+vo = getEliminationOrder(fg, constraints=[:l2], ordering=:ccolamd)
 
-  vo = getEliminationOrder(fg, constraints=[:l2], ordering=:ccolamd)
+@test vo[end] == :l2
 
-  @test vo[end] == :l2
 
+vo = getEliminationOrder(fg, constraints=[:x3;:l2], ordering=:ccolamd)
 
-  vo = getEliminationOrder(fg, constraints=[:x3;:l2], ordering=:ccolamd)
+@test intersect(vo[end-1:end], [:x3;:l2]) |> length == 2
 
-  @test intersect(vo[end-1:end], [:x3;:l2]) |> length == 2
-catch
-  @error "IncrInfrApproxMinDegreeExt test issue, work needed for Julia 1.10 compat via AMD.jl"
-  @test_broken false
-end
+  # catch
+#   @error "IncrInfrApproxMinDegreeExt test issue, work needed for Julia 1.10 compat via AMD.jl"
+#   @test_broken false
+# end
 
 ##
 end