trac #19253: add seealso section between complete, randomtournament a…

…nd randomsemicomplete
sagemath · Sep 20, 2015 · e45b71b · e45b71b
1 parent 7a8a54c
commit e45b71b
Showing 1 changed file with 18 additions and 0 deletions.
diff --git a/src/sage/graphs/digraph_generators.py b/src/sage/graphs/digraph_generators.py
@@ -400,6 +400,12 @@ def RandomTournament(self, n):
             Traceback (most recent call last):
             ...
             ValueError: The number of vertices cannot be strictly negative!
+
+        .. SEEALSO::
+
+            * :meth:`~sage.graphs.digraph_generator.DiGraphGenerators.Complete`
+
+            * :meth:`~sage.graphs.digraph_generator.DiGraphGenerators.RandomSemiComplete`        
         """
         from sage.misc.prandom import random
         g = DiGraph(n)
@@ -539,6 +545,12 @@ def Complete(self, n, loops=False):
             Traceback (most recent call last):
             ...
             ValueError: The number of vertices cannot be strictly negative!
+
+        .. SEEALSO::
+
+            * :meth:`~sage.graphs.digraph_generator.DiGraphGenerators.RandomSemiComplete`
+
+            * :meth:`~sage.graphs.digraph_generator.DiGraphGenerators.RandomTournament`        
         """
         G = DiGraph(n, name="Complete digraph"+(" with loops" if loops else ''), loops=loops)
 
@@ -1268,6 +1280,12 @@ def RandomSemiComplete(self, n):
             Traceback (most recent call last):
             ...
             ValueError: The number of vertices cannot be strictly negative!
+
+        .. SEEALSO::
+
+            * :meth:`~sage.graphs.digraph_generator.DiGraphGenerators.Complete`
+
+            * :meth:`~sage.graphs.digraph_generator.DiGraphGenerators.RandomTournament`        
         """
         G = DiGraph(n, name="Random Semi-Complete digraph")
         if n==0: