trac #26578: fix doctests in digraph_generators.py

sagemath · Oct 30, 2018 · e4be7c5 · e4be7c5
1 parent 9814a1b
commit e4be7c5
Showing 1 changed file with 4 additions and 4 deletions.
diff --git a/src/sage/graphs/digraph_generators.py b/src/sage/graphs/digraph_generators.py
@@ -422,7 +422,7 @@ def TransitiveTournament(self, n):
             sage: digraphs.TransitiveTournament(-1)
             Traceback (most recent call last):
             ...
-            ValueError: The number of vertices cannot be strictly negative!
+            ValueError: the number of vertices cannot be strictly negative
         """
         g = DiGraph(n)
         g.name("Transitive Tournament")
@@ -458,7 +458,7 @@ def RandomTournament(self, n):
             sage: digraphs.RandomTournament(-1)
             Traceback (most recent call last):
             ...
-            ValueError: The number of vertices cannot be strictly negative!
+            ValueError: the number of vertices cannot be strictly negative
 
         .. SEEALSO::
 
@@ -607,7 +607,7 @@ def Complete(self, n, loops=False):
             sage: digraphs.Complete(-1)
             Traceback (most recent call last):
             ...
-            ValueError: The number of vertices cannot be strictly negative!
+            ValueError: the number of vertices cannot be strictly negative
         """
         G = DiGraph(n, name="Complete digraph"+(" with loops" if loops else ''), loops=loops)
 
@@ -1410,7 +1410,7 @@ def RandomSemiComplete(self, n):
             sage: digraphs.RandomSemiComplete(-1)
             Traceback (most recent call last):
             ...
-            ValueError: The number of vertices cannot be strictly negative!
+            ValueError: the number of vertices cannot be strictly negative
         """
         G = DiGraph(n, name="Random Semi-Complete digraph")