PyPI - passagemath-graphs - Versions diffs - 10.6.1rc15__tar.gz → 10.6.2__tar.gz - Mend

passagemath-graphs 10.6.1rc15tar.gz → 10.6.2tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.

This version of passagemath-graphs might be problematic. Click here for more details.

Files changed (226) hide show

{passagemath_graphs-10.6.1rc15/passagemath_graphs.egg-info → passagemath_graphs-10.6.2}/PKG-INFO RENAMED Viewed

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-graphs
-Version: 10.6.1rc15
+Version: 10.6.2
 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
@@ -8,7 +8,7 @@ License-Expression: GPL-2.0-or-later
 Project-URL: release notes, https://github.com/passagemath/passagemath/releases
 Project-URL: repo (upstream), https://github.com/sagemath/sage
 Project-URL: repo, https://github.com/passagemath/passagemath
-Project-URL: documentation, https://doc.sagemath.org
+Project-URL: documentation, https://passagemath.org/docs/latest
 Project-URL: homepage (upstream), https://www.sagemath.org
 Project-URL: discourse, https://passagemath.discourse.group
 Project-URL: tracker (upstream), https://github.com/sagemath/sage/issues
@@ -33,9 +33,9 @@ Requires-Dist: gmpy2~=2.1.b999
 Requires-Dist: cysignals<1.12.4; sys_platform == "win32"
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-categories==10.6.1rc15
-Requires-Dist: passagemath-conf==10.6.1rc15
-Requires-Dist: passagemath-environment==10.6.1rc15
+Requires-Dist: passagemath-categories~=10.6.2.0
+Requires-Dist: passagemath-conf~=10.6.2.0; sys_platform != "win32"
+Requires-Dist: passagemath-environment~=10.6.2.0
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: benzene
@@ -108,24 +108,25 @@ It is a fork of `SageMath <https://www.sagemath.org/>`__, which has been
 developed 2005-2025 under the motto “Creating a Viable Open Source
 Alternative to Magma, Maple, Mathematica, and MATLAB”.
-The passagemath fork was created in October 2024 with the following
-goals:
+The passagemath fork uses the motto "Creating a Free Passage Between the
+Scientific Python Ecosystem and Mathematical Software Communities."
+It was created in October 2024 with the following goals:
--  providing modularized installation with pip, thus completing a `major
-   project started in 2020 in the Sage
-   codebase <https://github.com/sagemath/sage/issues/29705>`__,
+-  providing modularized installation with pip,
 -  establishing first-class membership in the scientific Python
    ecosystem,
 -  giving `clear attribution of upstream
    projects <https://groups.google.com/g/sage-devel/c/6HO1HEtL1Fs/m/G002rPGpAAAJ>`__,
 -  providing independently usable Python interfaces to upstream
    libraries,
--  providing `platform portability and integration testing
+-  offering `platform portability and integration testing
    services <https://github.com/passagemath/passagemath/issues/704>`__
    to upstream projects,
 -  inviting collaborations with upstream projects,
 -  `building a professional, respectful, inclusive
    community <https://groups.google.com/g/sage-devel/c/xBzaINHWwUQ>`__,
+-  `empowering Sage users to participate in the scientific Python ecosystem
+   <https://github.com/passagemath/passagemath/issues/248>`__ by publishing packages,
 -  developing a port to `Pyodide <https://pyodide.org/en/stable/>`__ for
    serverless deployment with Javascript,
 -  developing a native Windows port.
@@ -133,19 +134,24 @@ goals:
 `Full documentation <https://doc.sagemath.org/html/en/index.html>`__ is
 available online.
-passagemath attempts to support all major Linux distributions and recent versions of
-macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
-virtualization.
+passagemath attempts to support and provides binary wheels suitable for
+all major Linux distributions and recent versions of macOS.
-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.
+For the Linux aarch64 (ARM) platform, some third-party packages are still missing
+wheels; see the `instructions for building them from source <https://github.com/passagemath/passagemath?tab=readme-ov-file#full-installation-of-passagemath-from-binary-wheels-on-pypi>`__.
+Binary wheels for native Windows (x86_64) are are available for a subset of
+the passagemath distributions. Use of the full functionality of passagemath
+on Windows currently requires the use of Windows Subsystem for Linux (WSL)
+or virtualization.
+The supported Python versions in the passagemath 10.6.x series are 3.10.x-3.13.x.
 About this pip-installable distribution package
 -----------------------------------------------
-This pip-installable package `passagemath-graphs` is a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", `passagemath-standard`) for computations with graphs, posets, complexes, etc.
+This pip-installable package ``passagemath-graphs`` is a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", ``passagemath-standard``) for computations with graphs, posets, complexes, etc.
 It consists of over 170 first-party Python and Cython modules and uses the `Boost Graph Library <https://github.com/boostorg/graph>`_, with additional functionality from `NetworkX <https://networkx.github.io/>`_ and several other libraries.
@@ -153,23 +159,23 @@ It consists of over 170 first-party Python and Cython modules and uses the `Boos
 What is included
 ----------------
-* `Graph Theory <https://doc.sagemath.org/html/en/reference/graphs/index.html>`_
+* `Graph Theory <https://passagemath.org/docs/latest/html/en/reference/graphs/index.html>`_
-* `Trees <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees>`_
+* `Trees <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees>`_
-* `Posets <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/posets/all.html>`_
+* `Posets <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/posets/all.html>`_
-* `Abstract Complexes <https://doc.sagemath.org/html/en/reference/topology/index.html>`_
+* `Abstract Complexes <https://passagemath.org/docs/latest/html/en/reference/topology/index.html>`_
-* `Combinatorial Designs and Incidence Structure <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/all.html>`_
+* `Combinatorial Designs and Incidence Structure <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/designs/all.html>`_
-* `Finite State Machines, Automata, Transducers <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/finite_state_machine.html>`_
+* `Finite State Machines, Automata, Transducers <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/finite_state_machine.html>`_
-* `Cluster Algebras and Quivers <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/cluster_algebra_quiver/all.html>`_
+* `Cluster Algebras and Quivers <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/cluster_algebra_quiver/all.html>`_
-* `Knot Theory <https://doc.sagemath.org/html/en/reference/knots/index.html>`_
+* `Knot Theory <https://passagemath.org/docs/latest/html/en/reference/knots/index.html>`_
-* `Sandpiles <https://doc.sagemath.org/html/en/reference/dynamics/sage/sandpiles/sandpile.html>`_
+* `Sandpiles <https://passagemath.org/docs/latest/html/en/reference/dynamics/sage/sandpiles/sandpile.html>`_
 * see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-graphs/MANIFEST.in

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/README.rst RENAMED Viewed

@@ -10,24 +10,25 @@ It is a fork of `SageMath <https://www.sagemath.org/>`__, which has been
 developed 2005-2025 under the motto “Creating a Viable Open Source
 Alternative to Magma, Maple, Mathematica, and MATLAB”.
-The passagemath fork was created in October 2024 with the following
-goals:
+The passagemath fork uses the motto "Creating a Free Passage Between the
+Scientific Python Ecosystem and Mathematical Software Communities."
+It was created in October 2024 with the following goals:
--  providing modularized installation with pip, thus completing a `major
-   project started in 2020 in the Sage
-   codebase <https://github.com/sagemath/sage/issues/29705>`__,
+-  providing modularized installation with pip,
 -  establishing first-class membership in the scientific Python
    ecosystem,
 -  giving `clear attribution of upstream
    projects <https://groups.google.com/g/sage-devel/c/6HO1HEtL1Fs/m/G002rPGpAAAJ>`__,
 -  providing independently usable Python interfaces to upstream
    libraries,
--  providing `platform portability and integration testing
+-  offering `platform portability and integration testing
    services <https://github.com/passagemath/passagemath/issues/704>`__
    to upstream projects,
 -  inviting collaborations with upstream projects,
 -  `building a professional, respectful, inclusive
    community <https://groups.google.com/g/sage-devel/c/xBzaINHWwUQ>`__,
+-  `empowering Sage users to participate in the scientific Python ecosystem
+   <https://github.com/passagemath/passagemath/issues/248>`__ by publishing packages,
 -  developing a port to `Pyodide <https://pyodide.org/en/stable/>`__ for
    serverless deployment with Javascript,
 -  developing a native Windows port.
@@ -35,19 +36,24 @@ goals:
 `Full documentation <https://doc.sagemath.org/html/en/index.html>`__ is
 available online.
-passagemath attempts to support all major Linux distributions and recent versions of
-macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
-virtualization.
+passagemath attempts to support and provides binary wheels suitable for
+all major Linux distributions and recent versions of macOS.
-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.
+For the Linux aarch64 (ARM) platform, some third-party packages are still missing
+wheels; see the `instructions for building them from source <https://github.com/passagemath/passagemath?tab=readme-ov-file#full-installation-of-passagemath-from-binary-wheels-on-pypi>`__.
+Binary wheels for native Windows (x86_64) are are available for a subset of
+the passagemath distributions. Use of the full functionality of passagemath
+on Windows currently requires the use of Windows Subsystem for Linux (WSL)
+or virtualization.
+The supported Python versions in the passagemath 10.6.x series are 3.10.x-3.13.x.
 About this pip-installable distribution package
 -----------------------------------------------
-This pip-installable package `passagemath-graphs` is a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", `passagemath-standard`) for computations with graphs, posets, complexes, etc.
+This pip-installable package ``passagemath-graphs`` is a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", ``passagemath-standard``) for computations with graphs, posets, complexes, etc.
 It consists of over 170 first-party Python and Cython modules and uses the `Boost Graph Library <https://github.com/boostorg/graph>`_, with additional functionality from `NetworkX <https://networkx.github.io/>`_ and several other libraries.
@@ -55,23 +61,23 @@ It consists of over 170 first-party Python and Cython modules and uses the `Boos
 What is included
 ----------------
-* `Graph Theory <https://doc.sagemath.org/html/en/reference/graphs/index.html>`_
+* `Graph Theory <https://passagemath.org/docs/latest/html/en/reference/graphs/index.html>`_
-* `Trees <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees>`_
+* `Trees <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees>`_
-* `Posets <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/posets/all.html>`_
+* `Posets <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/posets/all.html>`_
-* `Abstract Complexes <https://doc.sagemath.org/html/en/reference/topology/index.html>`_
+* `Abstract Complexes <https://passagemath.org/docs/latest/html/en/reference/topology/index.html>`_
-* `Combinatorial Designs and Incidence Structure <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/all.html>`_
+* `Combinatorial Designs and Incidence Structure <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/designs/all.html>`_
-* `Finite State Machines, Automata, Transducers <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/finite_state_machine.html>`_
+* `Finite State Machines, Automata, Transducers <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/finite_state_machine.html>`_
-* `Cluster Algebras and Quivers <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/cluster_algebra_quiver/all.html>`_
+* `Cluster Algebras and Quivers <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/cluster_algebra_quiver/all.html>`_
-* `Knot Theory <https://doc.sagemath.org/html/en/reference/knots/index.html>`_
+* `Knot Theory <https://passagemath.org/docs/latest/html/en/reference/knots/index.html>`_
-* `Sandpiles <https://doc.sagemath.org/html/en/reference/dynamics/sage/sandpiles/sandpile.html>`_
+* `Sandpiles <https://passagemath.org/docs/latest/html/en/reference/dynamics/sage/sandpiles/sandpile.html>`_
 * see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-graphs/MANIFEST.in

passagemath_graphs-10.6.2/VERSION.txt ADDED Viewed

	@@ -0,0 +1 @@
1	+ 10.6.2

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2/passagemath_graphs.egg-info}/PKG-INFO RENAMED Viewed

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-graphs
-Version: 10.6.1rc15
+Version: 10.6.2
 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
@@ -8,7 +8,7 @@ License-Expression: GPL-2.0-or-later
 Project-URL: release notes, https://github.com/passagemath/passagemath/releases
 Project-URL: repo (upstream), https://github.com/sagemath/sage
 Project-URL: repo, https://github.com/passagemath/passagemath
-Project-URL: documentation, https://doc.sagemath.org
+Project-URL: documentation, https://passagemath.org/docs/latest
 Project-URL: homepage (upstream), https://www.sagemath.org
 Project-URL: discourse, https://passagemath.discourse.group
 Project-URL: tracker (upstream), https://github.com/sagemath/sage/issues
@@ -33,9 +33,9 @@ Requires-Dist: gmpy2~=2.1.b999
 Requires-Dist: cysignals<1.12.4; sys_platform == "win32"
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: memory_allocator
-Requires-Dist: passagemath-categories==10.6.1rc15
-Requires-Dist: passagemath-conf==10.6.1rc15
-Requires-Dist: passagemath-environment==10.6.1rc15
+Requires-Dist: passagemath-categories~=10.6.2.0
+Requires-Dist: passagemath-conf~=10.6.2.0; sys_platform != "win32"
+Requires-Dist: passagemath-environment~=10.6.2.0
 Provides-Extra: test
 Requires-Dist: passagemath-repl; extra == "test"
 Provides-Extra: benzene
@@ -108,24 +108,25 @@ It is a fork of `SageMath <https://www.sagemath.org/>`__, which has been
 developed 2005-2025 under the motto “Creating a Viable Open Source
 Alternative to Magma, Maple, Mathematica, and MATLAB”.
-The passagemath fork was created in October 2024 with the following
-goals:
+The passagemath fork uses the motto "Creating a Free Passage Between the
+Scientific Python Ecosystem and Mathematical Software Communities."
+It was created in October 2024 with the following goals:
--  providing modularized installation with pip, thus completing a `major
-   project started in 2020 in the Sage
-   codebase <https://github.com/sagemath/sage/issues/29705>`__,
+-  providing modularized installation with pip,
 -  establishing first-class membership in the scientific Python
    ecosystem,
 -  giving `clear attribution of upstream
    projects <https://groups.google.com/g/sage-devel/c/6HO1HEtL1Fs/m/G002rPGpAAAJ>`__,
 -  providing independently usable Python interfaces to upstream
    libraries,
--  providing `platform portability and integration testing
+-  offering `platform portability and integration testing
    services <https://github.com/passagemath/passagemath/issues/704>`__
    to upstream projects,
 -  inviting collaborations with upstream projects,
 -  `building a professional, respectful, inclusive
    community <https://groups.google.com/g/sage-devel/c/xBzaINHWwUQ>`__,
+-  `empowering Sage users to participate in the scientific Python ecosystem
+   <https://github.com/passagemath/passagemath/issues/248>`__ by publishing packages,
 -  developing a port to `Pyodide <https://pyodide.org/en/stable/>`__ for
    serverless deployment with Javascript,
 -  developing a native Windows port.
@@ -133,19 +134,24 @@ goals:
 `Full documentation <https://doc.sagemath.org/html/en/index.html>`__ is
 available online.
-passagemath attempts to support all major Linux distributions and recent versions of
-macOS. Use on Windows currently requires the use of Windows Subsystem for Linux or
-virtualization.
+passagemath attempts to support and provides binary wheels suitable for
+all major Linux distributions and recent versions of macOS.
-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.
+For the Linux aarch64 (ARM) platform, some third-party packages are still missing
+wheels; see the `instructions for building them from source <https://github.com/passagemath/passagemath?tab=readme-ov-file#full-installation-of-passagemath-from-binary-wheels-on-pypi>`__.
+Binary wheels for native Windows (x86_64) are are available for a subset of
+the passagemath distributions. Use of the full functionality of passagemath
+on Windows currently requires the use of Windows Subsystem for Linux (WSL)
+or virtualization.
+The supported Python versions in the passagemath 10.6.x series are 3.10.x-3.13.x.
 About this pip-installable distribution package
 -----------------------------------------------
-This pip-installable package `passagemath-graphs` is a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", `passagemath-standard`) for computations with graphs, posets, complexes, etc.
+This pip-installable package ``passagemath-graphs`` is a distribution of a part of the Sage Library.  It provides a small subset of the modules of the Sage library ("sagelib", ``passagemath-standard``) for computations with graphs, posets, complexes, etc.
 It consists of over 170 first-party Python and Cython modules and uses the `Boost Graph Library <https://github.com/boostorg/graph>`_, with additional functionality from `NetworkX <https://networkx.github.io/>`_ and several other libraries.
@@ -153,23 +159,23 @@ It consists of over 170 first-party Python and Cython modules and uses the `Boos
 What is included
 ----------------
-* `Graph Theory <https://doc.sagemath.org/html/en/reference/graphs/index.html>`_
+* `Graph Theory <https://passagemath.org/docs/latest/html/en/reference/graphs/index.html>`_
-* `Trees <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees>`_
+* `Trees <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees>`_
-* `Posets <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/posets/all.html>`_
+* `Posets <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/posets/all.html>`_
-* `Abstract Complexes <https://doc.sagemath.org/html/en/reference/topology/index.html>`_
+* `Abstract Complexes <https://passagemath.org/docs/latest/html/en/reference/topology/index.html>`_
-* `Combinatorial Designs and Incidence Structure <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/all.html>`_
+* `Combinatorial Designs and Incidence Structure <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/designs/all.html>`_
-* `Finite State Machines, Automata, Transducers <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/finite_state_machine.html>`_
+* `Finite State Machines, Automata, Transducers <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/finite_state_machine.html>`_
-* `Cluster Algebras and Quivers <https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/cluster_algebra_quiver/all.html>`_
+* `Cluster Algebras and Quivers <https://passagemath.org/docs/latest/html/en/reference/combinat/sage/combinat/cluster_algebra_quiver/all.html>`_
-* `Knot Theory <https://doc.sagemath.org/html/en/reference/knots/index.html>`_
+* `Knot Theory <https://passagemath.org/docs/latest/html/en/reference/knots/index.html>`_
-* `Sandpiles <https://doc.sagemath.org/html/en/reference/dynamics/sage/sandpiles/sandpile.html>`_
+* `Sandpiles <https://passagemath.org/docs/latest/html/en/reference/dynamics/sage/sandpiles/sandpile.html>`_
 * see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-graphs/MANIFEST.in

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/passagemath_graphs.egg-info/requires.txt RENAMED Viewed

@@ -1,9 +1,11 @@
 gmpy2~=2.1.b999
 cysignals!=1.12.0,>=1.11.2
 memory_allocator
-passagemath-categories==10.6.1rc15
-passagemath-conf==10.6.1rc15
-passagemath-environment==10.6.1rc15
+passagemath-categories~=10.6.2.0
+passagemath-environment~=10.6.2.0
+[:sys_platform != "win32"]
+passagemath-conf~=10.6.2.0
 [:sys_platform == "win32"]
 cysignals<1.12.4

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/pyproject.toml RENAMED Viewed

@@ -3,11 +3,11 @@
 # Minimum requirements for the build system to execute.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-setup == 10.6.1rc15',
+    'passagemath-setup ~= 10.6.2.0',
     'pkgconfig',
-    'passagemath-conf == 10.6.1rc15',
-    'passagemath-environment == 10.6.1rc15',
-    'passagemath-categories == 10.6.1rc15',
+    'passagemath-conf ~= 10.6.2.0 ; sys_platform != "win32"',
+    'passagemath-environment ~= 10.6.2.0',
+    'passagemath-categories ~= 10.6.2.0',
     'cython >=3.0, != 3.0.3, <4.0', 'cython >=3.0.8,<3.1.0',
     'gmpy2 ~=2.1.b999',
     'cysignals <1.12.4; sys_platform == "win32"', 'cysignals >=1.11.2, != 1.12.0',
@@ -22,9 +22,9 @@ dependencies = [
     'gmpy2 ~=2.1.b999',
     'cysignals <1.12.4; sys_platform == "win32"', 'cysignals >=1.11.2, != 1.12.0',
     'memory_allocator',
-    'passagemath-categories == 10.6.1rc15',
-    'passagemath-conf == 10.6.1rc15',
-    'passagemath-environment == 10.6.1rc15',
+    'passagemath-categories ~= 10.6.2.0',
+    'passagemath-conf ~= 10.6.2.0 ; sys_platform != "win32"',
+    'passagemath-environment ~= 10.6.2.0',
 ]
 dynamic = ["version"]
 license = "GPL-2.0-or-later"
@@ -55,7 +55,7 @@ requires-python = ">=3.10, <3.14"
 "release notes" = "https://github.com/passagemath/passagemath/releases"
 "repo (upstream)" = "https://github.com/sagemath/sage"
 "repo" = "https://github.com/passagemath/passagemath"
-documentation = "https://doc.sagemath.org"
+documentation = "https://passagemath.org/docs/latest"
 "homepage (upstream)" = "https://www.sagemath.org"
 "discourse" = "https://passagemath.discourse.group"
 "tracker (upstream)" = "https://github.com/sagemath/sage/issues"

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/combinat/cluster_algebra_quiver/quiver.py RENAMED Viewed

@@ -2225,13 +2225,12 @@ class ClusterQuiver(SageObject):
             ...
             ValueError: only makes sense for quivers of finite type
         """
-        from sage.geometry.fan import Fan
         if not self.is_finite():
             raise ValueError('only makes sense for quivers of finite type')
         from .cluster_seed import ClusterSeed
         from sage.geometry.cone import Cone
+        from sage.geometry.fan import Fan
         seed = ClusterSeed(self)
         return Fan([Cone(s.d_matrix().columns())

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/combinat/nu_tamari_lattice.py RENAMED Viewed

@@ -1,5 +1,5 @@
 # sage_setup: distribution = sagemath-graphs
-# sage.doctest: needs sage.combinat
+# sage.doctest: needs sage.combinat sage.modules
 r"""
 `\nu`-Tamari lattice

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/combinat/posets/linear_extensions.py RENAMED Viewed

@@ -775,7 +775,7 @@ class LinearExtensionsOfPoset(UniqueRepresentation, Parent):
             sage: P = Poset(([1,2,3,4], [[1,3],[1,4],[2,3]]), linear_extension=True, facade=True)
             sage: L = P.linear_extensions()
-            sage: G = L.markov_chain_digraph(labeling='source'); G
+            sage: G = L.markov_chain_digraph(labeling='source'); G                      # needs sage.modules
             Looped multi-digraph on 5 vertices
         """
         L = sorted(self)

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/graphs/digraph_generators.py RENAMED Viewed

@@ -1452,11 +1452,11 @@ class DiGraphGenerators:
         EXAMPLES::
             sage: D = digraphs.RandomDirectedAcyclicGraph(5, .5); D
-            RandomDAG(5, 0.500000000000000): Digraph on 5 vertices
+            RandomDAG(5, 0.5...): Digraph on 5 vertices
             sage: D.is_directed_acyclic()
             True
             sage: D = digraphs.RandomDirectedAcyclicGraph(5, .5, weight_max=3); D
-            RandomWeightedDAG(5, 0.500000000000000, 3): Digraph on 5 vertices
+            RandomWeightedDAG(5, 0.5..., 3): Digraph on 5 vertices
             sage: D.is_directed_acyclic()
             True

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/graphs/generators/distance_regular.pyx RENAMED Viewed

@@ -2744,7 +2744,7 @@ def distance_regular_graph(list arr, existence=False, check=True):
         Hamming Graph with parameters 7,3: Graph on 2187 vertices
         sage: graphs.distance_regular_graph([66, 45, 28, 1, 6, 30])
         Graph on 1024 vertices
-        sage: graphs.distance_regular_graph([6,5,5,5,1,1,1,6])  # optional - database_graphs
+        sage: graphs.distance_regular_graph([6,5,5,5,1,1,1,6])  # optional - database_graphs, needs sage.modules
         Generalised octagon of order (1, 5): Graph on 312 vertices
         sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)         # needs sage.libs.gap
         Graph on 325 vertices

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/graphs/hyperbolicity.pyx RENAMED Viewed

@@ -1249,7 +1249,7 @@ def hyperbolicity(G,
         sage: from sage.graphs.hyperbolicity import hyperbolicity
         sage: G = graphs.PetersenGraph()
-        sage: hyperbolicity(G, algorithm='CCL', approximation_factor=0.1)
+        sage: hyperbolicity(G, algorithm='CCL', approximation_factor=0.1)               # needs sage.rings.real_mpfr
         Traceback (most recent call last):
         ...
         ValueError: the approximation factor must be >= 1.0

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/graphs/matching_covered_graph.py RENAMED Viewed

@@ -2877,6 +2877,7 @@ class MatchingCoveredGraph(Graph):
         Each of Petersen graph, Bicorn graph, Tricorn graph, Cubeplex graph,
         Twinplex graph, Wagner graph is a brick::
+            sage: # needs sage.symbolic
             sage: MatchingCoveredGraph(graphs.PetersenGraph()).is_brick() and \
             ....: MatchingCoveredGraph(graphs.StaircaseGraph(4)).is_brick() and \
             ....: MatchingCoveredGraph(graphs.TricornGraph()).is_brick() and \

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/graphs/strongly_regular_db.pyx RENAMED Viewed

@@ -1502,7 +1502,7 @@ def is_twograph_descendant_of_srg(int v, int k0, int l, int mu):
     TESTS::
-        sage: graphs.strongly_regular_graph(279, 150, 85, 75, existence=True)           # needs sage.combinat
+        sage: graphs.strongly_regular_graph(279, 150, 85, 75, existence=True)           # needs sage.combinat sage.modules
         True
         sage: graphs.strongly_regular_graph(279, 150, 85, 75).is_strongly_regular(parameters=True)  # optional - gap_package_design internet
         (279, 150, 85, 75)
@@ -2836,9 +2836,9 @@ def strongly_regular_graph(int v, int k, int l, int mu=-1, bint existence=False,
     A set of parameters unknown to be realizable in Andries Brouwer's database::
-        sage: graphs.strongly_regular_graph(324,95,22,30, existence=True)               # needs database_graphs sage.combinat
+        sage: graphs.strongly_regular_graph(324,95,22,30, existence=True)               # needs database_graphs sage.combinat sage.modules
         Unknown
-        sage: graphs.strongly_regular_graph(324,95,22,30)                               # needs database_graphs sage.combinat
+        sage: graphs.strongly_regular_graph(324,95,22,30)                               # needs database_graphs sage.combinat sage.modules
         Traceback (most recent call last):
         ...
         RuntimeError: Andries Brouwer's database reports that no
@@ -3120,11 +3120,11 @@ def _build_small_srg_database():
         complement(two-intersection set in PG(4,3)): Graph on 81 vertices
         sage: graphs.strongly_regular_graph(243, 220, 199, 200)                 # long time, needs sage.rings.finite_rings
         two-weight code: [55, 5] linear code over GF(3): Graph on 243 vertices
-        sage: graphs.strongly_regular_graph(256, 153, 92, 90)                           # needs sage.combinat
+        sage: graphs.strongly_regular_graph(256, 153, 92, 90)                           # needs sage.combinat sage.modules
         complement(two-intersection set in PG(4,4)): Graph on 256 vertices
-        sage: graphs.strongly_regular_graph(256, 170, 114, 110)                         # needs sage.combinat
+        sage: graphs.strongly_regular_graph(256, 170, 114, 110)                         # needs sage.combinat sage.modules
         complement(two-intersection set in PG(8,2)): Graph on 256 vertices
-        sage: graphs.strongly_regular_graph(256, 187, 138, 132)                         # needs sage.combinat
+        sage: graphs.strongly_regular_graph(256, 187, 138, 132)                         # needs sage.combinat sage.modules
         complement(two-intersection set in PG(8,2)): Graph on 256 vertices
         sage: graphs.strongly_regular_graph(512, 73, 12, 10)                    # not tested (too long), needs sage.rings.finite_rings
         two-weight code: [219, 9] linear code over GF(2): Graph on 512 vertices

{passagemath_graphs-10.6.1rc15 → passagemath_graphs-10.6.2}/sage/graphs/views.pyx RENAMED Viewed

@@ -786,7 +786,7 @@ cdef class EdgesView:
             sage: E * 1.5
             Traceback (most recent call last):
             ...
-            TypeError: can...t multiply sequence by non-int of type 'sage.rings.real_mpfr.RealLiteral'
+            TypeError: can...t multiply sequence by non-int of type 'sage.rings.real...'
         """
         if isinstance(left, EdgesView):
             return list(left) * right