passagemath-graphs 10.5.38__cp313-cp313-macosx_14_0_arm64.whl → 10.5.44__cp313-cp313-macosx_14_0_arm64.whl

sage/combinat/designs/MOLS_handbook_data.py

@@ -1,11 +1,11 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Known lower bounds on the number of Mutually Orthogonal Latin
-Squares (MOLS) of a given size.
+Bounds on the number of mutually orthogonal Latin squares
 
-This module consists (almost) entirely of an internal, constant tuple
-of python integers corresponding to Table 3.87 in the Handbook of
-Combinatorial Designs, 2nd edition, by Colbourn and Dinitz. One public
+This module contains known lower bounds on the number of mutually orthogonal
+Latin squares (MOLS) of a given size, and consists (almost) entirely of an
+internal, constant tuple of Python integers corresponding to Table 3.87 in the
+Handbook of Combinatorial Designs, 2nd edition, by Colbourn and Dinitz. One public
 function, :func:`lower_bound`, is provided to access it.
 
 Make sure we have all of the entries::

sage/combinat/designs/bibd.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Balanced Incomplete Block Designs (BIBD)
+Balanced incomplete block designs (BIBD)
 
 This module gathers everything related to Balanced Incomplete Block Designs. One can build a
 BIBD (or check that it can be built) with :func:`balanced_incomplete_block_design`::

sage/combinat/designs/covering_array.py

@@ -1,13 +1,13 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Covering Arrays (CA)
+Covering arrays
 
-A Covering Array, denoted `CA(N;t,k,v)`, is an `N` by `k` array with
+A covering array, denoted `CA(N;t,k,v)`, is an `N` by `k` array with
 entries from a set of `v` elements with the property that in every
 selection of `t` columns, every sequence of `t` elements appears in at
 least one row.
 
-An Orthogonal Array, denoted `OA(N;t,k,v)` is a covering array with the
+An orthogonal array, denoted `OA(N;t,k,v)` is a covering array with the
 property that every sequence of `t`-elements appears in exactly one row.
 (See :mod:`sage.combinat.designs.orthogonal_arrays`).
 

sage/combinat/designs/covering_design.py

@@ -49,7 +49,6 @@ Classes and methods
 from urllib.request import urlopen
 from ssl import create_default_context as default_context
 
-from sage.misc.sage_eval import sage_eval
 from sage.structure.sage_object import SageObject
 from sage.rings.rational import Rational
 from sage.arith.misc import binomial
@@ -513,6 +512,8 @@ def best_known_covering_design_www(v, k, t, verbose=False):
     A :exc:`ValueError` is raised if the ``(v, k, t)`` parameters are not
     found in the database.
     """
+    from sage.misc.sage_eval import sage_eval
+
     v = int(v)
     k = int(k)
     t = int(t)

sage/combinat/designs/difference_matrices.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Difference Matrices
+Difference matrices
 
 This module gathers code related to difference matrices. One can build those
 objects (or know if they can be built) with :func:`difference_matrix`::

sage/combinat/designs/ext_rep.py

@@ -1,13 +1,13 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-External Representations of Block Designs
+External representations of block designs
 
-The "ext_rep" module is an API to the abstract tree represented by
+This module is an API to the abstract tree represented by
 an XML document containing the External Representation of a list of
 block designs. The module also provides the related I/O operations for
-reading/writing ext-rep files or data. The parsing is based on expat.
+reading/writing ``ext-rep`` files or data. The parsing is based on expat.
 
-This is a modified form of the module ext_rep.py (version 0.8)
+This is a modified form of the module ``ext_rep.py`` (version 0.8)
 written by Peter Dobcsanyi [Do2009]_ peter@designtheory.org.
 
 .. TODO::
@@ -16,12 +16,9 @@ written by Peter Dobcsanyi [Do2009]_ peter@designtheory.org.
     information about things like automorphism groups, transitivity, cycle type
     representatives, etc, but none of this data is made available through the
     current implementation.
-
-Functions
----------
 """
 
-###########################################################################
+# ***********************************************************************
 # This software is released under the terms of the GNU General Public
 # License, version 2 or above (your choice). For details on licensing,
 # see the accompanying documentation.
@@ -29,9 +26,9 @@ Functions
 # This is a modified form of the module ext_rep.py (version 0.8)
 # written by Peter Dobcsanyi peter@designtheory.org.
 #
-# Copyright 2004 by Peter Dobcsanyi peter@designtheory.org, and copyright
-# 2009 Carlo Hamalainen carlo.hamalainen@gmail.com
-###########################################################################
+# Copyright 2004 Peter Dobcsanyi peter@designtheory.org
+#           2009 Carlo Hamalainen carlo.hamalainen@gmail.com
+# ***********************************************************************
 
 import sys
 import xml.parsers.expat
@@ -598,7 +595,6 @@ def _encode_attribute(string):
         sage: _encode_attribute('E')
         'E'
     """
-
     if pattern_integer.match(string):
         return int(string)
     elif pattern_decimal.match(string):
@@ -611,8 +607,7 @@ class XTree:
     '''
     A lazy class to wrap a rooted tree representing an XML document.
     The tree's nodes are tuples of the structure:
-
-        (name, {dictionary of attributes}, [list of children])
+    (name, {dictionary of attributes}, [list of children])
 
     Methods and services of an XTree object ``t``:
 

sage/combinat/designs/group_divisible_designs.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Group-Divisible Designs (GDD)
+Group-divisible designs (GDD)
 
 This module gathers everything related to Group-Divisible Designs. The
 constructions defined here can be accessed through ``designs.<tab>``::

sage/combinat/designs/incidence_structures.py

@@ -365,11 +365,11 @@ class IncidenceStructure:
             True
             sage: ["Am", "I", "finally", "done ?"] in IS
             False
-            sage: IS = designs.ProjectiveGeometryDesign(3, 1, GF(2),                    # needs sage.combinat
+            sage: IS = designs.ProjectiveGeometryDesign(3, 1, GF(2),                    # needs sage.combinat sage.modules
             ....:                                       point_coordinates=False)
-            sage: [3,8,7] in IS                                                         # needs sage.combinat
+            sage: [3,8,7] in IS                                                         # needs sage.combinat sage.modules
             True
-            sage: [3,8,9] in IS                                                         # needs sage.combinat
+            sage: [3,8,9] in IS                                                         # needs sage.combinat sage.modules
             False
         """
         try:
@@ -1508,10 +1508,10 @@ class IncidenceStructure:
             sage: BD.is_t_design(0,6,3,7) or BD.is_t_design(0,7,4,7) or BD.is_t_design(0,7,3,8)
             False
 
-            sage: BD = designs.AffineGeometryDesign(3, 1, GF(2))                        # needs sage.combinat
-            sage: BD.is_t_design(1)                                                     # needs sage.combinat
+            sage: BD = designs.AffineGeometryDesign(3, 1, GF(2))                        # needs sage.combinat sage.modules
+            sage: BD.is_t_design(1)                                                     # needs sage.combinat sage.modules
             True
-            sage: BD.is_t_design(2)                                                     # needs sage.combinat
+            sage: BD.is_t_design(2)                                                     # needs sage.combinat sage.modules
             True
 
         Steiner triple and quadruple systems are other names for `2-(v,3,1)` and
@@ -1924,8 +1924,8 @@ class IncidenceStructure:
             sage: TD.is_resolvable()
             True
 
-            sage: AG = designs.AffineGeometryDesign(3,1,GF(2))                          # needs sage.combinat
-            sage: AG.is_resolvable()                                                    # needs sage.combinat
+            sage: AG = designs.AffineGeometryDesign(3,1,GF(2))                          # needs sage.combinat sage.modules
+            sage: AG.is_resolvable()                                                    # needs sage.combinat sage.modules
             True
 
         Their classes::

sage/combinat/designs/latin_squares.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.modules
 r"""
-Mutually Orthogonal Latin Squares (MOLS)
+Mutually orthogonal Latin squares (MOLS)
 
 The main function of this module is :func:`mutually_orthogonal_latin_squares`
 and can be can be used to generate MOLS (or check that they exist)::

sage/combinat/designs/resolvable_bibd.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Resolvable Balanced Incomplete Block Design (RBIBD)
+Resolvable balanced incomplete block design (RBIBD)
 
 This module contains everything related to resolvable Balanced Incomplete Block
 Designs. The constructions implemented here can be obtained through the

sage/combinat/designs/steiner_quadruple_systems.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Steiner Quadruple Systems
+Steiner quadruple systems
 
 A Steiner Quadruple System on `n` points is a family `SQS_n \subset \binom {[n]}
 4` of `4`-sets, such that any set `S\subset [n]` of size three is a subset of

sage/combinat/finite_state_machine_generators.py

@@ -1,9 +1,9 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.graphs sage.modules
 r"""
-Common Automata and Transducers (Finite State Machines Generators)
+Common automata and transducers (finite state machines generators)
 
-Automata and Transducers in Sage can be built through the
+Automata and transducers in Sage can be built through the
 :class:`automata <AutomatonGenerators>`
 and :class:`transducers <TransducerGenerators>` objects, respectively.
 It contains generators for

sage/combinat/graph_path.py

@@ -1,8 +1,8 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Paths in Directed Acyclic Graphs
+Paths in directed acyclic graphs
 """
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2007 Mike Hansen <mhansen@gmail.com>,
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -15,7 +15,7 @@ Paths in Directed Acyclic Graphs
 #  The full text of the GPL is available at:
 #
 #                  http://www.gnu.org/licenses/
-#*****************************************************************************
+# ****************************************************************************
 
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.structure.parent import Parent

sage/combinat/ordered_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 """
-Ordered Rooted Trees
+Ordered rooted trees
 
 AUTHORS:
 

sage/combinat/posets/cartesian_product.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 """
-Cartesian products of Posets
+Cartesian products of posets
 
 AUTHORS:
 

sage/combinat/posets/d_complete.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.combinat sage.modules
 r"""
-D-Complete Posets
+D-complete posets
 
 AUTHORS:
 

sage/combinat/posets/forest.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Forest Posets
+Forest posets
 
 AUTHORS:
 

sage/combinat/posets/incidence_algebras.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.modules
 r"""
-Incidence Algebras
+Incidence algebras
 """
 # ****************************************************************************
 #       Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>

sage/combinat/posets/linear_extension_iterator.pyx

@@ -160,6 +160,8 @@ def _linear_extension_gen(_D, list _le, list _a, list _b, list _is_plus, Py_ssiz
     if i == -1:
         return
 
+    import sage.matrix  # otherwise there will be a lot of "Exception ignored in: 'linear_extension_iterator._linear_extension_right_b'"
+
     for e in _linear_extension_gen(_D, _le, _a, _b, _is_plus, i-1):
         yield e
     mrb = 0

sage/combinat/posets/linear_extensions.py

@@ -1,16 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Linear Extensions of Posets
-
-This module defines two classes:
-
-- :class:`LinearExtensionOfPoset`
-- :class:`LinearExtensionsOfPoset`
-- :class:`LinearExtensionsOfPosetWithHooks`
-- :class:`LinearExtensionsOfForest`
-
-Classes and methods
--------------------
+Linear extensions of posets
 """
 # ****************************************************************************
 #       Copyright (C) 2012 Anne Schilling <anne at math.ucdavis.edu>
@@ -532,7 +522,7 @@ class LinearExtensionsOfPoset(UniqueRepresentation, Parent):
             True
             sage: L._poset is P
             True
-            sage: TestSuite(L).run()
+            sage: TestSuite(L).run()                                                    # needs sage.modules
 
             sage: P = Poset((divisors(15), attrcall("divides")))
             sage: L = P.linear_extensions()
@@ -732,6 +722,7 @@ class LinearExtensionsOfPoset(UniqueRepresentation, Parent):
 
         EXAMPLES::
 
+            sage: # needs sage.modules
             sage: P = Poset(([1,2,3,4], [[1,3],[1,4],[2,3]]), linear_extension=True)
             sage: L = P.linear_extensions()
             sage: G = L.markov_chain_digraph(); G

sage/combinat/posets/moebius_algebra.py

@@ -1,7 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 # sage.doctest: needs sage.modules
 r"""
-Möbius Algebras
+Möbius algebras
 """
 # ****************************************************************************
 #       Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>,

sage/combinat/rooted_tree.py

@@ -1,6 +1,6 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Rooted (Unordered) Trees
+Rooted (unordered) trees
 
 AUTHORS:
 

sage/graphs/generators/distance_regular.pyx

@@ -2746,7 +2746,7 @@ def distance_regular_graph(list arr, existence=False, check=True):
         Graph on 1024 vertices
         sage: graphs.distance_regular_graph([6,5,5,5,1,1,1,6])  # optional - database_graphs
         Generalised octagon of order (1, 5): Graph on 312 vertices
-        sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)
+        sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)         # needs sage.libs.gap
         Graph on 325 vertices
     """
     from sage.misc.unknown import Unknown

sage/graphs/graph.py

@@ -379,7 +379,7 @@ suitable for inclusion in a `\LaTeX` document.  More details on this are at the
 
     sage: from sage.graphs.graph_latex import check_tkz_graph
     sage: check_tkz_graph()  # random - depends on TeX installation
-    sage: latex(G)
+    sage: latex(G)                                                                      # needs sage.plot
     \begin{tikzpicture}
     ...
     \end{tikzpicture}

sage/graphs/graph_list.py

@@ -19,9 +19,6 @@ AUTHORS:
 # ****************************************************************************
 
 
-from sage.misc.misc import try_read
-
-
 def from_whatever(data):
     r"""
     Return a list of Sage Graphs, given a list of whatever kind of data.
@@ -78,6 +75,8 @@ def _from_whatever(data, fmt=None):
     if isinstance(data, str):
         lines = data.splitlines()
     else:
+        from sage.misc.misc import try_read
+
         lines = try_read(data, splitlines=True)
 
         if lines is not None and fmt is None:

sage/sandpiles/sandpile.py

@@ -339,7 +339,6 @@ from sage.graphs.digraph import DiGraph
 from sage.graphs.graph import Graph
 from sage.misc.functional import det, denominator
 from sage.misc.lazy_import import lazy_import
-from sage.misc.misc import exists
 from sage.misc.misc_c import prod
 from sage.misc.temporary_file import tmp_filename
 from sage.rings.integer import Integer
@@ -1542,7 +1541,7 @@ class Sandpile(DiGraph):
         else:
             rec = list(self.recurrents())
             for r in self.recurrents():
-                if exists(rec, lambda x: r > x)[0]:
+                if any(r > x for x in rec):
                     rec.remove(r)
         self._min_recurrents = rec