doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/cliques/maximimum_clique.jl:15-27 ```jldoctest julia> using Graphs julia> using GraphInvariants julia> g = cycle_graph(5) {5, 5} undirected simple Int64 graph julia> compute(MaximumClique, g) 3-element Vector{Int64}: 1 2 ``` Subexpression: compute(MaximumClique, g) Evaluated output: Running HiGHS 1.6.0: Copyright (c) 2023 HiGHS under MIT licence terms Presolving model 5 rows, 5 cols, 10 nonzeros 5 rows, 5 cols, 10 nonzeros Objective function is integral with scale 1 Solving MIP model with: 5 rows 5 cols (5 binary, 0 integer, 0 implied int., 0 continuous) 10 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3 -inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 3 -0 Large 0 0 0 0 0.0s R 0 0 0 0.00% 2.5 1 150.00% 0 0 0 5 0.0s H 0 0 0 0.00% 2 2 0.00% 1 1 1 6 0.0s Solving report Status Optimal Primal bound 2 Dual bound 2 Gap 0% (tolerance: 0.01%) Solution status feasible 2 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.00 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 6 (total) 0 (strong br.) 1 (separation) 0 (heuristics) 2-element Vector{Int64}: 1 5 Expected output: 3-element Vector{Int64}: 1 2 diff = Warning: Diff output requires color. 3-element Vector{Int64}: 1 2Running HiGHS 1.6.0: Copyright (c) 2023 HiGHS under MIT licence terms Presolving model 5 rows, 5 cols, 10 nonzeros 5 rows, 5 cols, 10 nonzeros Objective function is integral with scale 1 Solving MIP model with: 5 rows 5 cols (5 binary, 0 integer, 0 implied int., 0 continuous) 10 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3 -inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 3 -0 Large 0 0 0 0 0.0s R 0 0 0 0.00% 2.5 1 150.00% 0 0 0 5 0.0s H 0 0 0 0.00% 2 2 0.00% 1 1 1 6 0.0s Solving report Status Optimal Primal bound 2 Dual bound 2 Gap 0% (tolerance: 0.01%) Solution status feasible 2 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.00 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 6 (total) 0 (strong br.) 1 (separation) 0 (heuristics) 2-element Vector{Int64}: 1 5

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/cliques/clique_number.jl:11-19 ```jldoctest julia> using Graphs julia> g = path_graph(5) {5, 4} undirected simple Int64 graph julia> clique_number(g) 2 ``` Subexpression: clique_number(g) Evaluated output: ERROR: UndefVarError: `clique_number` not defined Stacktrace: [1] top-level scope @ none:1 Expected output: 2 diff = Warning: Diff output requires color. 2ERROR: UndefVarError: `clique_number` not defined Stacktrace: [1] top-level scope @ none:1

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/domination/minimum_dominating_sets.jl:16-28 ```jldoctest julia> using Graphs julia> using GraphInvariants julia> g = cycle_graph(5) {5, 5} undirected simple Int64 graph julia> compute(MinimumDominatingSet, g) 2-element Vector{Int64}: 1 3 ``` Subexpression: compute(MinimumDominatingSet, g) Evaluated output: 2-element Vector{Int64}: 2 5 Expected output: 2-element Vector{Int64}: 1 3 diff = Warning: Diff output requires color. 2-element Vector{Int64}: 1 3Vector{Int64}: 2 5

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/domination/minimum_dominating_sets.jl:78-91 ```jldoctest julia> using Graphs julia> using GraphInvariants julia> g = cycle_graph(5) {5, 5} undirected simple Int64 graph julia> compute(MinimumTotalDominatingSet, g) 3-element Vector{Int64}: 1 2 3 ``` Subexpression: compute(MinimumTotalDominatingSet, g) Evaluated output: 3-element Vector{Int64}: 2 3 4 Expected output: 3-element Vector{Int64}: 1 2 3 diff = Warning: Diff output requires color. 3-element Vector{Int64}: 1 2 3Vector{Int64}: 2 3 4

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/matching/matching_sets.jl:15-27 ```jldoctest julia> using Graphs julia> using GraphInvariants julia> g = cycle_graph(5) {5, 5} undirected simple Int64 graph julia> compute(MaximumMatching, g) 2-element Vector{Edge{Int64}}: Edge 1 => 2 Edge 3 => 4 ``` Subexpression: compute(MaximumMatching, g) Evaluated output: 2-element Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}: Edge 1 => 2 Edge 3 => 4 Expected output: 2-element Vector{Edge{Int64}}: Edge 1 => 2 Edge 3 => 4 diff = Warning: Diff output requires color. 2-element Vector{Edge{Int64}}: Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}: Edge 1 => 2 Edge 3 => 4

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/GraphRules/havel_hakimi.jl:73-95 ```jldoctest julia> using GraphInvariants julia> D = [3, 3, 2, 2, 1, 1] julia> eliminations = Int[] julia> apply!(HavelHakimiRule, D, eliminations) true julia> D 6-element Vector{Int64}: 2 1 1 1 1 1 julia> eliminations 1-element Vector{Int64}: 3 ``` Subexpression: D = [3, 3, 2, 2, 1, 1] Evaluated output: 6-element Vector{Int64}: 3 3 2 2 1 1 Expected output: diff = Warning: Diff output requires color. 6-element Vector{Int64}: 3 3 2 2 1 1

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/GraphRules/havel_hakimi.jl:73-95 ```jldoctest julia> using GraphInvariants julia> D = [3, 3, 2, 2, 1, 1] julia> eliminations = Int[] julia> apply!(HavelHakimiRule, D, eliminations) true julia> D 6-element Vector{Int64}: 2 1 1 1 1 1 julia> eliminations 1-element Vector{Int64}: 3 ``` Subexpression: eliminations = Int[] Evaluated output: Int64[] Expected output: diff = Warning: Diff output requires color. Int64[]

doctest failure in ~/work/GraphInvariants.jl/GraphInvariants.jl/src/GraphRules/havel_hakimi.jl:73-95 ```jldoctest julia> using GraphInvariants julia> D = [3, 3, 2, 2, 1, 1] julia> eliminations = Int[] julia> apply!(HavelHakimiRule, D, eliminations) true julia> D 6-element Vector{Int64}: 2 1 1 1 1 1 julia> eliminations 1-element Vector{Int64}: 3 ``` Subexpression: D Evaluated output: 5-element Vector{Int64}: 2 1 1 1 1 Expected output: 6-element Vector{Int64}: 2 1 1 1 1 1 diff = Warning: Diff output requires color. 6-element 5-element Vector{Int64}: 2 1 1 1 1 1

Process completed with exit code 1.

1 docstring not included in the manual: GraphInvariants.GraphRules.apply! :: Tuple{Type{HavelHakimiRule}, Vector{Int64}, Vector{Int64}} These are docstrings in the checked modules (configured with the modules keyword) that are not included in @docs or @autodocs blocks.