Update to sagemath 6.2

2025-04-22 11:45:56 -04:00 · 2014-05-27 10:47:12 -03:00 · 2014-05-27 10:47:12 -03:00 · fa9204b9a9
commit fa9204b9a9
parent 52d9e04212
25 changed files with 9618 additions and 7756 deletions
--- a/sagemath-sphinx.patch
+++ b/sagemath-sphinx.patch
@ -0,0 +1,139 @@
+diff -up src/sage/graphs/generic_graph.py.orig src/sage/graphs/generic_graph.py
+--- src/sage/graphs/generic_graph.py.orig	2014-05-26 15:38:33.169069789 -0300
+++ src/sage/graphs/generic_graph.py	2014-05-26 15:41:55.071077520 -0300
+@@ -9222,7 +9222,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)
+@@ -11504,10 +11504,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()
+@@ -13369,13 +13369,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::
+ 
+@@ -13494,13 +13494,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-05-26 15:42:17.579078382 -0300
+++ src/sage/graphs/graph.py	2014-05-26 16:04:45.519129999 -0300
+@@ -2704,9 +2704,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::
+ 
+@@ -2751,9 +2751,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::
+ 
+@@ -2788,9 +2788,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:
+ 
+@@ -2827,9 +2827,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:
+ 
+@@ -5751,8 +5751,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:
+ 
+@@ -5937,7 +5937,7 @@ class Graph(GenericGraph):
+ 
+         .. SEEALSO::
+ 
+-        - :meth:`is_prime` -- Tests whether a graph is prime.
+            - :meth:`is_prime` -- Tests whether a graph is prime.
+ 
+         REFERENCE:
+