From fdb8832ddc0cf7c3cd2853c3cbcc92a94cedb3fd Mon Sep 17 00:00:00 2001
From: "James D. Mitchell" <jdm3@st-andrews.ac.uk>
Date: Wed, 26 May 2021 11:16:23 +0100
Subject: [PATCH] Code coverage

---
 tst/standard/examples.tst |  4 ++++
 tst/standard/grape.tst    | 12 ++++++++++++
 2 files changed, 16 insertions(+)

diff --git a/tst/standard/examples.tst b/tst/standard/examples.tst
index 4340ff5e3..6a00f8383 100644
--- a/tst/standard/examples.tst
+++ b/tst/standard/examples.tst
@@ -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);
@@ -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();
diff --git a/tst/standard/grape.tst b/tst/standard/grape.tst
index 5fe9ae5a8..65101cd74 100644
--- a/tst/standard/grape.tst
+++ b/tst/standard/grape.tst
@@ -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);