sagemath#39269: remove dot at the end of some sentences

Author: dcoudert

src/sage/graphs/digraph_generators.py

@@ -239,7 +239,7 @@ def ButterflyGraph(self, n, vertices='strings', immutable=False):
           (``vertices='vectors'``)
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         EXAMPLES::
 
@@ -353,7 +353,7 @@ def Path(self, n, immutable=False):
         - ``n`` -- integer; number of vertices in the path
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         EXAMPLES::
 
@@ -383,7 +383,7 @@ def StronglyRegular(self, n, immutable=False):
         - ``n`` -- integer; the number of vertices of the digraph
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         .. SEEALSO::
 
@@ -435,7 +435,7 @@ def Paley(self, q, immutable=False):
         - ``q`` -- integer; the number of vertices of the digraph
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         .. SEEALSO::
 
@@ -497,7 +497,7 @@ def TransitiveTournament(self, n, immutable=False):
         - ``n`` -- integer; number of vertices in the tournament
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         EXAMPLES::
 
@@ -546,7 +546,7 @@ def RandomTournament(self, n, immutable=False):
         - ``n`` -- integer; number of vertices
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         EXAMPLES::
 
@@ -611,7 +611,7 @@ def tournaments_nauty(self, n,
           `<https://pallini.di.uniroma1.it>`_.
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          immutable or mutable digraphs.
+          immutable or mutable digraphs
 
         EXAMPLES::
 
@@ -710,7 +710,7 @@ def nauty_directg(self, graphs, options='', debug=False, immutable=False):
           standard error and standard output are displayed
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          immutable or mutable digraphs.
+          immutable or mutable digraphs
 
         EXAMPLES::
 
@@ -826,7 +826,7 @@ def nauty_posetg(self, options='', debug=False, immutable=False):
           beginning with ">E" indicates an error with the input.
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          immutable or mutable posets.
+          immutable or mutable posets
 
         The possible options, obtained as output of ``genposetg --help``::
 
@@ -875,7 +875,7 @@ def Complete(self, n, loops=False, immutable=False):
           not, i.e., edges from `u` to itself
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         .. SEEALSO::
 
@@ -923,7 +923,7 @@ def Circuit(self, n, immutable=False):
         - ``n`` -- integer; number of vertices
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         EXAMPLES:
 
@@ -962,7 +962,7 @@ def Circulant(self, n, integers, immutable=False):
           is an integer
 
         - ``immutable`` -- boolean (default: ``False``); whether to return
-          an immutable or mutable digraph.
+          an immutable or mutable digraph
 
         EXAMPLES:
 
@@ -1415,7 +1415,7 @@ def RandomDirectedAcyclicGraph(self, n, p, weight_max=None, immutable=False):
           are assigned a random integer weight between ``1`` and ``weight_max``.
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         EXAMPLES::
 
@@ -1503,7 +1503,7 @@ def RandomDirectedGN(self, n, kernel=None, seed=None, immutable=False):
           random number generator (default: ``None``)
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         EXAMPLES::
 
@@ -1546,7 +1546,7 @@ def RandomDirectedGNC(self, n, seed=None, immutable=False):
           random number generator (default: ``None``)
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         EXAMPLES::
 
@@ -1583,7 +1583,7 @@ def RandomDirectedGNP(self, n, p, loops=False, seed=None, immutable=False):
           generator
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         PLOTTING: When plotting, this graph will use the default spring-layout
         algorithm, unless a position dictionary is specified.
@@ -1619,7 +1619,7 @@ def RandomDirectedGNM(self, n, m, loops=False, immutable=False):
         - ``loops`` -- boolean (default: ``False``); whether to allow loops
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         PLOTTING: When plotting, this graph will use the default spring-layout
         algorithm, unless a position dictionary is specified.
@@ -1755,7 +1755,7 @@ def RandomDirectedGNR(self, n, p, seed=None, immutable=False):
           random number generator (default: ``None``)
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         EXAMPLES::
 
@@ -1793,7 +1793,7 @@ def RandomSemiComplete(self, n, immutable=False):
         - ``n`` -- integer; the number of nodes
 
         - ``immutable`` -- boolean (default: ``False``); whether to return an
-          immutable or mutable digraph.
+          immutable or mutable digraph
 
         .. SEEALSO::