@@ -276,8 +276,7 @@ function _coloring(
276276 :: ColoringProblem{:symmetric,:column} ,
277277 algo:: GreedyColoringAlgorithm{:direct} ,
278278 decompression_eltype:: Type ,
279- symmetric_pattern:: Bool ;
280- forced_colors:: Union{AbstractVector{<:Integer},Nothing} = nothing ,
279+ symmetric_pattern:: Bool ,
281280)
282281 ag = AdjacencyGraph (A; has_diagonal= true )
283282 color_and_star_set_by_order = map (algo. orders) do order
@@ -298,8 +297,7 @@ function _coloring(
298297 :: ColoringProblem{:symmetric,:column} ,
299298 algo:: GreedyColoringAlgorithm{:substitution} ,
300299 decompression_eltype:: Type{R} ,
301- symmetric_pattern:: Bool ;
302- forced_colors:: Union{AbstractVector{<:Integer},Nothing} = nothing ,
300+ symmetric_pattern:: Bool ,
303301) where {R}
304302 ag = AdjacencyGraph (A; has_diagonal= true )
305303 color_and_tree_set_by_order = map (algo. orders) do order
@@ -320,7 +318,8 @@ function _coloring(
320318 :: ColoringProblem{:nonsymmetric,:bidirectional} ,
321319 algo:: GreedyColoringAlgorithm{:direct} ,
322320 decompression_eltype:: Type{R} ,
323- symmetric_pattern:: Bool ,
321+ symmetric_pattern:: Bool ;
322+ forced_colors:: Union{AbstractVector{<:Integer},Nothing} = nothing ,
324323) where {R}
325324 A_and_Aᵀ, edge_to_index = bidirectional_pattern (A; symmetric_pattern)
326325 ag = AdjacencyGraph (A_and_Aᵀ, edge_to_index; has_diagonal= false )
0 commit comments