Skip to content

Commit

Permalink
Code coverage
Browse files Browse the repository at this point in the history
  • Loading branch information
james-d-mitchell committed May 26, 2021
1 parent 5924a1d commit fdb8832
Show file tree
Hide file tree
Showing 2 changed files with 16 additions and 0 deletions.
4 changes: 4 additions & 0 deletions tst/standard/examples.tst
Original file line number Diff line number Diff line change
Expand Up @@ -392,6 +392,8 @@ gap> DigraphUndirectedGirth(D);
6
gap> IsHamiltonianDigraph(D);
true
gap> D := PancakeGraph(IsMutableDigraph, 1);
<mutable empty digraph with 1 vertex>
# BurntPancakeGraph
gap> BurntPancakeGraph(3);
Expand All @@ -403,6 +405,8 @@ es>
gap> BurntPancakeGraph(5);
<immutable Hamiltonian connected symmetric digraph with 3840 vertices, 19200 e\
dges>
gap> BurntPancakeGraph(IsMutableDigraph, 1);
<mutable digraph with 1 vertex, 1 edge>
#
gap> DIGRAPHS_StopTest();
Expand Down
12 changes: 12 additions & 0 deletions tst/standard/grape.tst
Original file line number Diff line number Diff line change
Expand Up @@ -273,6 +273,18 @@ gap> Digraph(IsSemigroup, SymmetricGroup(3), [1, 2, 3], OnPoints,
> {x, y} -> x <> y);
Error, <imm> must be IsMutableDigraph or IsImmutableDigraph

# Code coverage
gap> D := Digraph([[1, 1]]);
<immutable multidigraph with 1 vertex, 2 edges>
gap> Graph(D);
rec( adjacencies := [ [ 1 ] ], group := Group(()), isGraph := true,
names := [ 1 ], order := 1, representatives := [ 1 ],
schreierVector := [ -1 ] )
gap> D := CompleteDigraph(IsMutableDigraph, 5);;
gap> HasDigraphGroup(D);
false
gap> Graph(D);;

#
gap> DIGRAPHS_StopTest();
gap> STOP_TEST("Digraphs package: standard/grape.tst", 0);

0 comments on commit fdb8832

Please sign in to comment.