passagemath-graphs 10.5.43__tar.gz → 10.6.1rc1__tar.gz

{passagemath_graphs-10.5.43/passagemath_graphs.egg-info → passagemath_graphs-10.6.1rc1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-graphs
-Version: 10.5.43
+Version: 10.6.1rc1
 Summary: passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,20 +19,19 @@ Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: gmpy2~=2.1.b999
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-categories~=10.5.43.0
-Requires-Dist: passagemath-environment~=10.5.43.0
+Requires-Dist: passagemath-categories==10.6.1rc1
+Requires-Dist: passagemath-environment==10.6.1rc1
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: benzene
@@ -133,7 +132,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1}/README.rst

@@ -39,7 +39,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

passagemath_graphs-10.6.1rc1/VERSION.txt

@@ -0,0 +1 @@
+10.6.1.rc1

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1/passagemath_graphs.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-graphs
-Version: 10.5.43
+Version: 10.6.1rc1
 Summary: passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,20 +19,19 @@ Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: POSIX
 Classifier: Operating System :: MacOS :: MacOS X
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.14,>=3.9
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: gmpy2~=2.1.b999
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-categories~=10.5.43.0
-Requires-Dist: passagemath-environment~=10.5.43.0
+Requires-Dist: passagemath-categories==10.6.1rc1
+Requires-Dist: passagemath-environment==10.6.1rc1
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: benzene
@@ -133,7 +132,7 @@ passagemath attempts to support all major Linux distributions and recent version
 macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
 virtualization.
 
-Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.x.
+Complete sets of binary wheels are provided on PyPI for Python versions 3.10.x-3.13.x.
 Python 3.13.x is also supported, but some third-party packages are still missing wheels,
 so compilation from source is triggered for those.
 

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1}/passagemath_graphs.egg-info/SOURCES.txt

@@ -56,12 +56,14 @@ sage/combinat/designs/steiner_quadruple_systems.py
 sage/combinat/designs/subhypergraph_search.pyx
 sage/combinat/designs/twographs.py
 sage/combinat/posets/all.py
+sage/combinat/posets/bubble_shuffle.py
 sage/combinat/posets/cartesian_product.py
 sage/combinat/posets/d_complete.py
 sage/combinat/posets/elements.py
 sage/combinat/posets/forest.py
 sage/combinat/posets/hasse_cython.pyx
 sage/combinat/posets/hasse_diagram.py
+sage/combinat/posets/hochschild_lattice.py
 sage/combinat/posets/incidence_algebras.py
 sage/combinat/posets/lattices.py
 sage/combinat/posets/linear_extension_iterator.pyx

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1}/passagemath_graphs.egg-info/requires.txt

@@ -1,8 +1,8 @@
 gmpy2~=2.1.b999
 cysignals!=1.12.0,>=1.11.2
 memory_allocator
-passagemath-categories~=10.5.43.0
-passagemath-environment~=10.5.43.0
+passagemath-categories==10.6.1rc1
+passagemath-environment==10.6.1rc1
 
 [benzene]
 passagemath-benzene

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1}/pyproject.toml

@@ -3,10 +3,10 @@
 # Minimum requirements for the build system to execute.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-setup ~= 10.5.43.0',
+    'passagemath-setup == 10.6.1rc1',
     'pkgconfig',
-    'passagemath-environment ~= 10.5.43.0',
-    'passagemath-categories ~= 10.5.43.0',
+    'passagemath-environment == 10.6.1rc1',
+    'passagemath-categories == 10.6.1rc1',
     'cython >=3.0, != 3.0.3, <4.0', 'cython >=3.0.8,<3.1.0',
     'gmpy2 ~=2.1.b999',
     'cysignals >=1.11.2, != 1.12.0',
@@ -21,8 +21,8 @@ dependencies = [
     'gmpy2 ~=2.1.b999',
     'cysignals >=1.11.2, != 1.12.0',
     'memory_allocator',
-    'passagemath-categories ~= 10.5.43.0',
-    'passagemath-environment ~= 10.5.43.0',
+    'passagemath-categories == 10.6.1rc1',
+    'passagemath-environment == 10.6.1rc1',
 ]
 dynamic = ["version"]
 license = "GPL-2.0-or-later"
@@ -38,7 +38,6 @@ classifiers = [
     "Operating System :: POSIX",
     "Operating System :: MacOS :: MacOS X",
     "Programming Language :: Python :: 3 :: Only",
-    "Programming Language :: Python :: 3.9",
     "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
@@ -46,7 +45,7 @@ classifiers = [
     "Programming Language :: Python :: Implementation :: CPython",
     "Topic :: Scientific/Engineering :: Mathematics",
 ]
-requires-python = ">=3.9, <3.14"
+requires-python = ">=3.10, <3.14"
 
 [project.urls]
 "release notes" = "https://github.com/passagemath/passagemath/releases"

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1}/sage/combinat/abstract_tree.py

@@ -277,8 +277,7 @@ class AbstractTree:
         while stack:
             node = stack.pop()
             action(node)
-            for i in range(len(node)):
-                subtree = node[-i - 1]
+            for subtree in reversed(node):
                 if not subtree.is_empty():
                     stack.append(subtree)
 
@@ -640,8 +639,7 @@ class AbstractTree:
                 # subtrees, and should not be exploded again, but instead
                 # should be manipulated and removed from the stack.
                 stack.append(None)
-                for i in range(len(node)):
-                    subtree = node[-i - 1]
+                for subtree in reversed(node):
                     if not subtree.is_empty():
                         stack.append(subtree)
             else:
@@ -649,6 +647,114 @@ class AbstractTree:
                 node = stack.pop()
                 action(node)
 
+    def contour_traversal(self, first_action=None, middle_action=None, final_action=None, leaf_action=None):
+        r"""
+        Run the counterclockwise contour traversal algorithm (iterative
+        implementation) and subject every node encountered
+        to some procedure ``first_action``, ``middle_action`` or ``final_action`` each time it reaches it.
+
+        ALGORITHM:
+
+        - if the root is a leaf, apply `leaf_action`
+        - else
+            -  apply `first_action` to the root
+            - iteratively apply `middle_action` to the root and traverse each subtree
+              from the leftmost one to the rightmost one
+            - apply `final_action` to the root
+
+        INPUT:
+
+        - ``first_action`` -- (optional) a function which takes a node as
+          input, and does something the first time it is reached during exploration
+
+        - ``middle_action`` -- (optional) a function which takes a node as
+          input, and does something each time it explore one of its children
+
+        - ``final_action`` -- (optional) a function which takes a node as
+          input, and does something the last time it is reached during exploration
+
+        - ``leaf_action`` -- (optional) a function which takes a leaf as
+          input, and does something when it is reached during exploration.
+
+        OUTPUT:
+
+        ``None``. (This is *not* an iterator.)
+
+        TESTS::
+
+            sage: l = []
+            sage: t = OrderedTree([[],[[],[],]]).canonical_labelling()
+            sage: t
+            1[2[], 3[4[], 5[]]]
+            sage: t.contour_traversal(lambda node: (l.append(node.label()),l.append('a')),
+            ....:   lambda node: (l.append(node.label()),l.append('b')),
+            ....:   lambda node: (l.append(node.label()),l.append('c')),
+            ....:   lambda node: (l.append(node.label())))
+            sage: l
+            [1, 'a', 1, 'b', 2, 1, 'b', 3, 'a', 3, 'b', 4, 3, 'b', 5, 3, 'c', 1, 'c']
+
+            sage: l = []
+            sage: b = BinaryTree([[None,[]],[[[],[]],[]]]).canonical_labelling()
+            sage: b
+            3[1[., 2[., .]], 7[5[4[., .], 6[., .]], 8[., .]]]
+            sage: b.contour_traversal(lambda node: l.append(node.label()),
+            ....:   lambda node: l.append(node.label()),
+            ....:   lambda node: l.append(node.label()),
+            ....:   None)
+            sage: l
+            [3, 3, 1, 1, 1, 2, 2, 2, 2, 1, 3, 7, 7, 5, 5, 4, 4, 4, 4, 5, 6, 6, 6, 6, 5, 7, 8, 8, 8, 8, 7, 3]
+
+        The following test checks that things do not go wrong if some among
+        the descendants of the tree are equal or even identical::
+
+            sage: u = BinaryTree(None)
+            sage: v = BinaryTree([u, u])
+            sage: w = BinaryTree([v, v])
+            sage: t = BinaryTree([w, w])
+            sage: t.node_number()
+            7
+            sage: l = []
+            sage: t.contour_traversal(first_action = lambda node: l.append(0))
+            sage: len(l)
+            7
+        """
+        if first_action is None:
+            def first_action(x):
+                return
+        if middle_action is None:
+            def middle_action(x):
+                return
+        if final_action is None:
+            def final_action(x):
+                return
+        if leaf_action is None:
+            def leaf_action(x):
+                return
+        stack = []
+        stack.append(self)
+        corners = [0, 0]
+        while stack:
+            node = stack.pop()
+            if not node:
+                leaf_action(node)
+                corners.pop()
+                corners[-1] += 1
+            elif not corners[-1]:
+                first_action(node)
+                middle_action(node)
+                stack.append(node)
+                stack.append(node[0])
+                corners.append(0)
+            elif corners[-1] == len(node):
+                final_action(node)
+                corners.pop()
+                corners[-1] += 1
+            else:
+                middle_action(node)
+                stack.append(node)
+                stack.append(node[corners[-1]])
+                corners.append(0)
+
     def breadth_first_order_traversal(self, action=None):
         r"""
         Run the breadth-first post-order traversal algorithm
@@ -824,12 +930,41 @@ class AbstractTree:
             True
             sage: [T.node_number_at_depth(i) for i in range(3)]
             [0, 0, 0]
+
+        Check that we do not hit a recursion limit::
+
+            sage: T = OrderedTree([])
+            sage: for _ in range(9999):
+            ....:     T = OrderedTree([T])
+            sage: T.node_number_at_depth(2000)
+            1
         """
         if self.is_empty():
-            return Integer(0)
-        if depth == 0:
-            return Integer(1)
-        return sum(son.node_number_at_depth(depth - 1) for son in self)
+            return 0
+        m = 0
+
+        def fr_action(node):
+            nonlocal m, depths, depth
+            if depths[-1] == depth:
+                m += 1
+
+        def m_action(node):
+            nonlocal depths
+            depths.append(depths[-1] + 1)
+
+        def fn_action(node):
+            nonlocal depths
+            depths.pop()
+
+        def lf_action(node):
+            nonlocal m, depths, depth
+            if depths[-1] == depth:
+                m += 1
+            depths.pop()
+
+        depths = [0]
+        self.contour_traversal(fr_action, m_action, fn_action, lf_action)
+        return Integer(m)
 
     def paths_to_the_right(self, path):
         r"""
@@ -1053,11 +1188,25 @@ class AbstractTree:
             2
             sage: BinaryTree([[None, [[], []]], None]).node_number()
             5
+
+        TESTS:
+
+        Check that we do not hit a recursion limit::
+
+            sage: T = OrderedTree([])
+            sage: for _ in range(9999):
+            ....:     T = OrderedTree([T])
+            sage: T.node_number()
+            10000
         """
-        if self.is_empty():
-            return Integer(0)
-        else:
-            return sum((i.node_number() for i in self), Integer(1))
+        count = 0
+
+        def incr(node):
+            nonlocal count
+            count += 1
+
+        self.iterative_pre_order_traversal(incr)
+        return Integer(count)
 
     def depth(self):
         """
@@ -1080,11 +1229,33 @@ class AbstractTree:
             0
             sage: BinaryTree([[],[[],[]]]).depth()
             3
+
+        TESTS:
+
+        Check that we do not hit a recursion limit::
+
+            sage: T = OrderedTree([])
+            sage: for _ in range(9999):
+            ....:     T = OrderedTree([T])
+            sage: T.depth()
+            10000
         """
-        if self:
-            return Integer(1 + max(i.depth() for i in self))
-        else:
-            return Integer(0 if self.is_empty() else 1)
+        if self.is_empty():
+            return 0
+        m = []
+
+        def action(node):
+            nonlocal m
+            if node.is_empty():
+                m.append(-1)
+            elif not bool(node):
+                m.append(0)
+            else:
+                mx = max(m.pop() for _ in node)
+                m.append(mx + 1)
+
+        self.contour_traversal(final_action=action, leaf_action=action)
+        return Integer(m[0] + 1)
 
     def _ascii_art_(self):
         r"""
@@ -1308,7 +1479,7 @@ class AbstractTree:
         while l_repr:
             tr = l_repr.pop(0)
             acc += UnicodeArt([" "]) + tr
-            if not len(l_repr):
+            if not l_repr:
                 lf_sep += "─" * (tr._root) + "╮"
                 ls_sep += " " * (tr._root) + "│"
             else:

{passagemath_graphs-10.5.43 → passagemath_graphs-10.6.1rc1}/sage/combinat/cluster_algebra_quiver/interact.py

@@ -1,8 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Interactive window for cluster seed mutations
+Interactive display of quivers
 """
-
 import ipywidgets as widgets
 from sage.misc.latex import latex
 from sage.repl.rich_output.pretty_print import pretty_print