Skip to content

Cliques coverage #923

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
james-d-mitchell merged 3 commits into from
Apr 27, 2026
Merged

Cliques coverage #923

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
42c05a5
Test DigraphIndependentSets attribute recall
mtorpey Apr 22, 2026
0435735
Test CliquesFinder on big graphs with specified size
mtorpey Apr 25, 2026
9b3e01a
Test CliquesFinder with aut group and isolated vertices
mtorpey Apr 25, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions tst/standard/cliques.tst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -158,6 +158,8 @@ gap> DigraphMaximalIndependentSets(gr);
[ [ 1 ] ]
gap> DigraphIndependentSets(gr);
[ [ 1 ] ]
gap> DigraphIndependentSets(gr);
[ [ 1 ] ]
gap> DigraphMaximalIndependentSetsReps(gr, []);
[ [ 1 ] ]
gap> DigraphIndependentSetsReps(gr, []);
Expand Down Expand Up @@ -541,6 +543,26 @@ gap> f := function(a, b)
gap> CliquesFinder(gr, f, [], 4, [], [], false, 2, true);
[ 2, 2, 2, 2 ]

# Test CliquesFinder on big graphs with specific sizes specified
gap> D := DigraphMutableCopy(Digraph("hundredtwentycell"));;
gap> DigraphAddVertex(D);;
gap> DigraphAddEdges(D, [[43, 601], [601, 43], [63, 601], [601, 63]]);;
gap> DigraphAddEdges(D, [[283, 601], [601, 283], [303, 601], [601, 303]]);;
gap> DigraphAddVertex(D);;
gap> Set(DigraphMaximalCliques(D, [], [], infinity, 3));
[ [ 43, 63, 601 ], [ 283, 303, 601 ] ]
gap> DigraphMaximalCliques(D, [], [], infinity, 1);
[ [ 602 ] ]
gap> Length(DigraphMaximalCliques(D, [], [], infinity, 2));
1198

# Test CliquesFinder (reps) on graph with automorphisms and isolated vertices
gap> D := DigraphAddVertex(Digraph("hundredtwentycell"));;
gap> Size(AutomorphismGroup(D));
14400
gap> Set(DigraphMaximalCliquesReps(D));
[ [ 1, 2 ], [ 601 ] ]

# Test DigraphsCliqueFinder
gap> DigraphsCliquesFinder(0);
Error, there must be 8 or 9 arguments, found 1,
Expand Down
Loading