From 08d676de9b2fdd62bb547e7d7fd962fb76657ee0 Mon Sep 17 00:00:00 2001
From: Wilf Wilson <wilf@wilf-wilson.net>
Date: Tue, 12 Nov 2019 16:04:04 +0100
Subject: [PATCH] Fix ViewString for known non-complete digraphs

Closes #272.
---
 gap/digraph.gi      | 2 +-
 tst/testinstall.tst | 7 +++++++
 2 files changed, 8 insertions(+), 1 deletion(-)

diff --git a/gap/digraph.gi b/gap/digraph.gi
index 5bcce8762..9cae16960 100644
--- a/gap/digraph.gi
+++ b/gap/digraph.gi
@@ -449,7 +449,7 @@ function(D)
     elif HasIsChainDigraph(D) and IsChainDigraph(D) then
       Append(str, "chain ");
       display_nredges := false;
-    elif HasIsCompleteDigraph(D) and IsDigraph(D) then
+    elif HasIsCompleteDigraph(D) and IsCompleteDigraph(D) then
       Append(str, "complete ");
       display_nredges := false;
     elif HasIsCompleteBipartiteDigraph(D) and IsCompleteBipartiteDigraph(D) then
diff --git a/tst/testinstall.tst b/tst/testinstall.tst
index e923c7149..54fa3d37c 100644
--- a/tst/testinstall.tst
+++ b/tst/testinstall.tst
@@ -328,6 +328,13 @@ gap> D := NullDigraph(IsMutableDigraph, 10);
 gap> MakeImmutable(D);
 <immutable empty digraph with 10 vertices>
 
+# Issue 272: ViewString for known non-complete digraphs
+gap> D := Digraph([[2], []]);;
+gap> IsCompleteDigraph(D);
+false
+gap> D;
+<immutable digraph with 2 vertices, 1 edge>
+
 #  DIGRAPHS_UnbindVariables
 gap> Unbind(gr2);
 gap> Unbind(gr);