sagemath/sagemath-sphinx.patch
2014-08-15 13:30:04 -03:00

139 lines
5 KiB
Diff

diff -up src/sage/graphs/generic_graph.py.orig src/sage/graphs/generic_graph.py
--- src/sage/graphs/generic_graph.py.orig 2014-08-12 14:58:26.408065882 -0300
+++ src/sage/graphs/generic_graph.py 2014-08-12 14:58:29.914066017 -0300
@@ -9275,7 +9275,7 @@ class GenericGraph(GenericGraph_pyx):
.. SEEALSO::
- - :meth:`subdivide_edge` -- subdivides one edge
+ - :meth:`subdivide_edge` -- subdivides one edge
"""
for e in edges:
self.subdivide_edge(e, k)
@@ -11557,10 +11557,10 @@ class GenericGraph(GenericGraph_pyx):
.. SEEALSO::
- - :mod:`Interval Graph Recognition <sage.graphs.pq_trees>`.
+ - :mod:`Interval Graph Recognition <sage.graphs.pq_trees>`.
- - :meth:`PQ <sage.graphs.pq_trees.PQ>`
- -- Implementation of PQ-Trees.
+ - :meth:`PQ <sage.graphs.pq_trees.PQ>`
+ -- Implementation of PQ-Trees.
"""
self._scream_if_not_simple()
@@ -13429,13 +13429,13 @@ class GenericGraph(GenericGraph_pyx):
.. SEEALSO::
- - :meth:`breadth_first_search <sage.graphs.base.c_graph.CGraphBackend.breadth_first_search>`
- -- breadth-first search for fast compiled graphs.
+ - :meth:`breadth_first_search <sage.graphs.base.c_graph.CGraphBackend.breadth_first_search>`
+ -- breadth-first search for fast compiled graphs.
- - :meth:`depth_first_search <sage.graphs.base.c_graph.CGraphBackend.depth_first_search>`
- -- depth-first search for fast compiled graphs.
+ - :meth:`depth_first_search <sage.graphs.base.c_graph.CGraphBackend.depth_first_search>`
+ -- depth-first search for fast compiled graphs.
- - :meth:`depth_first_search` -- depth-first search for generic graphs.
+ - :meth:`depth_first_search` -- depth-first search for generic graphs.
EXAMPLES::
@@ -13554,13 +13554,13 @@ class GenericGraph(GenericGraph_pyx):
.. SEEALSO::
- - :meth:`breadth_first_search`
+ - :meth:`breadth_first_search`
- - :meth:`breadth_first_search <sage.graphs.base.c_graph.CGraphBackend.breadth_first_search>`
- -- breadth-first search for fast compiled graphs.
+ - :meth:`breadth_first_search <sage.graphs.base.c_graph.CGraphBackend.breadth_first_search>`
+ -- breadth-first search for fast compiled graphs.
- - :meth:`depth_first_search <sage.graphs.base.c_graph.CGraphBackend.depth_first_search>`
- -- depth-first search for fast compiled graphs.
+ - :meth:`depth_first_search <sage.graphs.base.c_graph.CGraphBackend.depth_first_search>`
+ -- depth-first search for fast compiled graphs.
EXAMPLES::
diff -up src/sage/graphs/graph.py.orig src/sage/graphs/graph.py
--- src/sage/graphs/graph.py.orig 2014-08-12 14:58:26.410065882 -0300
+++ src/sage/graphs/graph.py 2014-08-12 14:58:29.917066017 -0300
@@ -3023,9 +3023,9 @@ class Graph(GenericGraph):
.. SEEALSO::
- - :meth:`~Graph.is_arc_transitive`
- - :meth:`~Graph.is_half_transitive`
- - :meth:`~Graph.is_semi_symmetric`
+ - :meth:`~Graph.is_arc_transitive`
+ - :meth:`~Graph.is_half_transitive`
+ - :meth:`~Graph.is_semi_symmetric`
EXAMPLES::
@@ -3070,9 +3070,9 @@ class Graph(GenericGraph):
.. SEEALSO::
- - :meth:`~Graph.is_edge_transitive`
- - :meth:`~Graph.is_half_transitive`
- - :meth:`~Graph.is_semi_symmetric`
+ - :meth:`~Graph.is_edge_transitive`
+ - :meth:`~Graph.is_half_transitive`
+ - :meth:`~Graph.is_semi_symmetric`
EXAMPLES::
@@ -3107,9 +3107,9 @@ class Graph(GenericGraph):
.. SEEALSO::
- - :meth:`~Graph.is_edge_transitive`
- - :meth:`~Graph.is_arc_transitive`
- - :meth:`~Graph.is_semi_symmetric`
+ - :meth:`~Graph.is_edge_transitive`
+ - :meth:`~Graph.is_arc_transitive`
+ - :meth:`~Graph.is_semi_symmetric`
EXAMPLES:
@@ -3146,9 +3146,9 @@ class Graph(GenericGraph):
.. SEEALSO::
- - :meth:`~Graph.is_edge_transitive`
- - :meth:`~Graph.is_arc_transitive`
- - :meth:`~Graph.is_half_transitive`
+ - :meth:`~Graph.is_edge_transitive`
+ - :meth:`~Graph.is_arc_transitive`
+ - :meth:`~Graph.is_half_transitive`
EXAMPLES:
@@ -6114,8 +6114,8 @@ class Graph(GenericGraph):
.. SEEALSO::
- * Graph cores is also a notion related to graph homomorphisms. For
- this second meaning, see :meth:`Graph.has_homomorphism_to`.
+ * Graph cores is also a notion related to graph homomorphisms. For
+ this second meaning, see :meth:`Graph.has_homomorphism_to`.
REFERENCE:
@@ -6300,7 +6300,7 @@ class Graph(GenericGraph):
.. SEEALSO::
- - :meth:`is_prime` -- Tests whether a graph is prime.
+ - :meth:`is_prime` -- Tests whether a graph is prime.
REFERENCE: