passagemath-bliss 10.5.42__tar.gz → 10.6.1rc1__tar.gz

{passagemath_bliss-10.5.42/passagemath_bliss.egg-info → passagemath_bliss-10.6.1rc1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-bliss
-Version: 10.5.42
+Version: 10.6.1rc1
 Summary: passagemath: Graph (iso/auto)morphisms with bliss
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,14 +19,13 @@ 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: cysignals!=1.12.0,>=1.11.2
 Provides-Extra: test
@@ -74,7 +73,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.
 
@@ -82,8 +81,13 @@ so compilation from source is triggered for those.
 About this pip-installable distribution package
 -----------------------------------------------
 
-This pip-installable source distribution ``sagemath-bliss`` is a small
-optional distribution for use with ``sagemath-standard``.
+This pip-installable package `passagemath-bliss` 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`).
 
-It provides a Cython interface to the ``bliss`` library for the purpose
+It provides a Cython interface to the `bliss <https://users.aalto.fi/~tjunttil/bliss/index.html>`_ library for the purpose
 of computing graph (iso/auto)morphisms.
+
+
+What is included
+----------------
+
+* see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-bliss/MANIFEST.in

{passagemath_bliss-10.5.42 → passagemath_bliss-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.
 
@@ -47,8 +47,13 @@ so compilation from source is triggered for those.
 About this pip-installable distribution package
 -----------------------------------------------
 
-This pip-installable source distribution ``sagemath-bliss`` is a small
-optional distribution for use with ``sagemath-standard``.
+This pip-installable package `passagemath-bliss` 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`).
 
-It provides a Cython interface to the ``bliss`` library for the purpose
+It provides a Cython interface to the `bliss <https://users.aalto.fi/~tjunttil/bliss/index.html>`_ library for the purpose
 of computing graph (iso/auto)morphisms.
+
+
+What is included
+----------------
+
+* see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-bliss/MANIFEST.in

passagemath_bliss-10.6.1rc1/VERSION.txt

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

{passagemath_bliss-10.5.42 → passagemath_bliss-10.6.1rc1/passagemath_bliss.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-bliss
-Version: 10.5.42
+Version: 10.6.1rc1
 Summary: passagemath: Graph (iso/auto)morphisms with bliss
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -19,14 +19,13 @@ 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: cysignals!=1.12.0,>=1.11.2
 Provides-Extra: test
@@ -74,7 +73,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.
 
@@ -82,8 +81,13 @@ so compilation from source is triggered for those.
 About this pip-installable distribution package
 -----------------------------------------------
 
-This pip-installable source distribution ``sagemath-bliss`` is a small
-optional distribution for use with ``sagemath-standard``.
+This pip-installable package `passagemath-bliss` 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`).
 
-It provides a Cython interface to the ``bliss`` library for the purpose
+It provides a Cython interface to the `bliss <https://users.aalto.fi/~tjunttil/bliss/index.html>`_ library for the purpose
 of computing graph (iso/auto)morphisms.
+
+
+What is included
+----------------
+
+* see https://github.com/passagemath/passagemath/blob/main/pkgs/sagemath-bliss/MANIFEST.in

{passagemath_bliss-10.5.42 → passagemath_bliss-10.6.1rc1}/pyproject.toml

@@ -3,9 +3,9 @@
 # Minimum requirements for the build system to execute.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-conf ~= 10.5.42.0',
-    'passagemath-setup ~= 10.5.42.0',
-    'passagemath-environment ~= 10.5.42.0',
+    'passagemath-conf == 10.6.1rc1',
+    'passagemath-setup == 10.6.1rc1',
+    'passagemath-environment == 10.6.1rc1',
     'cython >=3.0, != 3.0.3, <4.0', 'cython >=3.0.8,<3.1.0',
     'cysignals >=1.11.2, != 1.12.0',
     'pkgconfig',
@@ -32,7 +32,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",
@@ -40,7 +39,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_bliss-10.5.42 → passagemath_bliss-10.6.1rc1}/sage/graphs/bliss.pyx

@@ -377,7 +377,9 @@ cdef canonical_form_from_edge_list(int Vnr, list Vout, list Vin, int Lnr=1, list
     return new_edges
 
 
-cpdef canonical_form(G, partition=None, return_graph=False, use_edge_labels=True, certificate=False) noexcept:
+cpdef canonical_form(G, partition=None, return_graph=False,
+                     use_edge_labels=True, certificate=False,
+                     immutable=None) noexcept:
     r"""
     Return a canonical label for the given (di)graph.
 
@@ -404,6 +406,12 @@ cpdef canonical_form(G, partition=None, return_graph=False, use_edge_labels=True
     - ``certificate`` -- boolean (default: ``False``); when set to ``True``,
       returns the labeling of G into a canonical graph
 
+    - ``immutable`` -- boolean (default: ``None``); whether to create a
+      mutable/immutable (di)graph. ``immutable=None`` (default) means that
+      the (di)graph and its canonical (di)graph will behave the same way.
+
+      This parameter is ignored when ``return_graph`` is ``False``.
+
     TESTS::
 
         sage: from sage.graphs.bliss import canonical_form                  # optional - bliss
@@ -503,6 +511,19 @@ cpdef canonical_form(G, partition=None, return_graph=False, use_edge_labels=True
         Traceback (most recent call last):
         ...
         ValueError: some vertices of the graph are not in the partition
+
+    Check the behavior of parameter ``immutable``::
+
+        sage: g = Graph({1: {2: 'a'}})
+        sage: canonical_form(g, return_graph=True).is_immutable()                   # optional - bliss
+        False
+        sage: canonical_form(g, return_graph=True, immutable=True).is_immutable()   # optional - bliss
+        True
+        sage: g = Graph({1: {2: 'a'}}, immutable=True)
+        sage: canonical_form(g, return_graph=True).is_immutable()                   # optional - bliss
+        True
+        sage: canonical_form(g, return_graph=True, immutable=False).is_immutable()  # optional - bliss
+        False
     """
     # We need this to convert the numbers from <unsigned int> to <long>.
     # This assertion should be true simply for memory reasons.
@@ -579,14 +600,17 @@ cpdef canonical_form(G, partition=None, return_graph=False, use_edge_labels=True
     relabel = {int2vert[i]: j for i, j in relabel.items()}
 
     if return_graph:
+        if immutable is None:
+            immutable = G.is_immutable()
         if directed:
-            from sage.graphs.digraph import DiGraph
-            H = DiGraph(new_edges, loops=G.allows_loops(), multiedges=G.allows_multiple_edges())
+            from sage.graphs.digraph import DiGraph as GT
         else:
-            from sage.graphs.graph import Graph
-            H = Graph(new_edges, loops=G.allows_loops(), multiedges=G.allows_multiple_edges())
+            from sage.graphs.graph import Graph as GT
+
+        H = GT([range(G.order()), new_edges], format='vertices_and_edges',
+               loops=G.allows_loops(), multiedges=G.allows_multiple_edges(),
+               immutable=immutable)
 
-        H.add_vertices(range(G.order()))
         return (H, relabel) if certificate else H
 
     # Warning: this may break badly in Python 3 if the graph is not simple

passagemath_bliss-10.5.42/VERSION.txt

@@ -1 +0,0 @@
-10.5.42