passagemath-tdlib 10.6.37__cp312-abi3-musllinux_1_2_x86_64.whl

passagemath_tdlib/__init__.py

@@ -0,0 +1,3 @@
+# sage_setup: distribution = sagemath-tdlib
+
+from sage.all__sagemath_tdlib import *

passagemath_tdlib-10.6.37.dist-info/METADATA

@@ -0,0 +1,93 @@
+Metadata-Version: 2.4
+Name: passagemath-tdlib
+Version: 10.6.37
+Summary: passagemath: Tree decompositions with tdlib
+Author-email: The Sage Developers <sage-support@googlegroups.com>
+Maintainer: Matthias Köppe, passagemath contributors
+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://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
+Project-URL: tracker, https://github.com/passagemath/passagemath/issues
+Classifier: Development Status :: 6 - Mature
+Classifier: Intended Audience :: Education
+Classifier: Intended Audience :: Science/Research
+Classifier: Operating System :: POSIX
+Classifier: Operating System :: POSIX :: Linux
+Classifier: Operating System :: MacOS :: MacOS X
+Classifier: Programming Language :: Python :: 3 :: Only
+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 :: 3.14
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: <3.15,>=3.10
+Description-Content-Type: text/x-rst
+Requires-Dist: cysignals<1.12.4; sys_platform == "win32"
+Requires-Dist: cysignals!=1.12.0,>=1.11.2
+Provides-Extra: test
+Requires-Dist: passagemath-repl; extra == "test"
+Requires-Dist: passagemath-graphs; extra == "test"
+
+========================================================================
+ passagemath: Tree decompositions with tdlib
+========================================================================
+
+`passagemath <https://github.com/passagemath/passagemath>`__ is open
+source mathematical software in Python, released under the GNU General
+Public Licence GPLv2+.
+
+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 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,
+-  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,
+-  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.
+
+`Full documentation <https://passagemath.org/docs/latest/html/en/index.html>`__ is
+available online.
+
+passagemath attempts to support and provides binary wheels suitable for
+all major Linux distributions and recent versions of macOS.
+
+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 distribution ``passagemath-tdlib`` is a small optional distribution for use with `passagemath-graphs <https://pypi.org/project/passagemath-graphs>`_.
+
+It provides a Cython interface to the ``tdlib`` library, now also known as `treedec <https://gitlab.com/freetdi/treedec>`_, providing
+algorithms concerning tree decompositions.

passagemath_tdlib-10.6.37.dist-info/RECORD

@@ -0,0 +1,12 @@
+passagemath_tdlib/__init__.py,sha256=pkf9WFBA6Z19IKlZZV-KQCzF-WoaEoYoiTPH6nRpfUo,84
+passagemath_tdlib.libs/libgcc_s-0cd532bd.so.1,sha256=QrXyyMoT5eFz2Df1EXoEtsBCQ3VIESveeHklGujc_48,183337
+passagemath_tdlib.libs/libstdc++-5d72f927.so.6.0.33,sha256=i_QxuLSNJcDImiug4WsF5wNgprWyeL3Mc09ILo-0-Dc,3564129
+sage/all__sagemath_tdlib.py,sha256=zag9UqFlkcjkiBCrkeLRFIXjnemsqnpTNJFfqQMezKE,64
+sage/graphs/all__sagemath_tdlib.py,sha256=xwEAp-3HSleZKAjcgudzEBoWekMyMSx7mY9lzHCETcU,44
+sage/graphs/graph_decompositions/all__sagemath_tdlib.py,sha256=xwEAp-3HSleZKAjcgudzEBoWekMyMSx7mY9lzHCETcU,44
+sage/graphs/graph_decompositions/tdlib.abi3.so,sha256=EJFrrxCXj66SdsJzQUC9AZW2jB3OIGzQ3UEwla1Aq0g,5485377
+sage/graphs/graph_decompositions/tdlib.pyx,sha256=hTSyIq_Va3AV1GzwepFuTGzNC77BhtPvSlLj1lOmM8M,5381
+passagemath_tdlib-10.6.37.dist-info/METADATA,sha256=jjXGxr7Lzcosd4ULVlliwfPRhiZIoSQIpgWpvuk9_Tk,4549
+passagemath_tdlib-10.6.37.dist-info/WHEEL,sha256=GIYi8yqodGXJf5_lS9HYm_ZYguPz6DgSMeewkgTvr7Y,111
+passagemath_tdlib-10.6.37.dist-info/top_level.txt,sha256=udVnGv8qRS4FCMdRgHx9y78553ikEdpWqhJa1_KYX-I,24
+passagemath_tdlib-10.6.37.dist-info/RECORD,,

passagemath_tdlib-10.6.37.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (80.9.0)
+Root-Is-Purelib: false
+Tag: cp312-abi3-musllinux_1_2_x86_64
+

passagemath_tdlib-10.6.37.dist-info/top_level.txt

@@ -0,0 +1,3 @@
+
+passagemath_tdlib
+sage

sage/all__sagemath_tdlib.py

@@ -0,0 +1,2 @@
+# sage_setup: distribution = sagemath-tdlib
+# delvewheel: patch

sage/graphs/all__sagemath_tdlib.py

@@ -0,0 +1 @@
+# sage_setup: distribution = sagemath-tdlib

sage/graphs/graph_decompositions/all__sagemath_tdlib.py

@@ -0,0 +1 @@
+# sage_setup: distribution = sagemath-tdlib

sage/graphs/graph_decompositions/tdlib.pyx

@@ -0,0 +1,185 @@
+# distutils: language = c++
+# distutils: extra_compile_args = -std=c++17
+# sage_setup: distribution = sagemath-tdlib
+
+r"""
+Interface with TdLib (algorithms for tree decompositions)
+
+This module defines functions based on TdLib, a library that implements
+algorithms for tree decompositions written by Lukas Larisch.
+
+**Definition** :
+
+A `tree decomposition` of a graph `G` is a pair `(T, \beta)` consisting of a
+tree T and a function `\beta: V(T) \rightarrow 2^{V(G)}` associating with each
+node `t \in V(T)` a set of vertices `\beta (t) \subseteq V(G)` such that
+
+* (T1) for every edge `e \in E(G)` there is a node `t \in V(T)` with `e
+  \subseteq \beta (t)`, and
+
+* (T2) for all `v \in V(G)` the set `\beta^{-1} := \{t \in V(T): v \in \beta
+  (t)\}` is non-empty and connected in T.
+
+The width of `(T, \beta)` is defined as `max\{|\beta (t)|-1: t \in V(T) \}`.
+The treewidth of G is defined as the minimum width over all tree decompositions
+of `G`.
+
+**Some known results** :
+
+- Trees have treewidth 1
+
+- Cycles have treewidth 2
+
+- Series-parallel graphs have treewidth at most 2
+
+- Cliques must be contained in some bag of a tree decomposition
+
+Computing the treewidth or a tree decomposition of a given graph is NP-hard in
+general.
+
+**This module contains the following functions** :
+
+.. csv-table::
+    :class: contentstable
+    :widths: 30, 70
+    :delim: |
+
+    :meth:`treedecomposition_exact` | Compute a tree decomposition of exact width
+    :meth:`get_width` | Return the width of a given tree decomposition
+
+
+AUTHOR: Lukas Larisch (10-25-2015): Initial version
+
+REFERENCE:
+
+- [ST1993]_
+
+- [AP1986]_
+
+- [Bod1993]_
+
+Methods
+-------
+"""
+
+from libcpp.vector cimport vector
+from cysignals.signals cimport sig_on, sig_off
+
+from sage.sets.set import Set
+from sage.graphs.graph import Graph
+
+cdef extern from "sage_tdlib.cpp":
+    int sage_exact_decomposition(vector[unsigned int] &V_G, vector[unsigned int] &E_G, vector[vector[int]] &V_T, vector[unsigned int] &E_T, int lb)
+
+
+##############################################################
+# ########## GRAPH/DECOMPOSITION ENCODING/DECODING ###########
+# the following will be used implicitly to do the translation
+# between Sage graph encoding and BGL graph encoding.
+
+cdef make_tdlib_graph(G, vertex_to_int, vector[unsigned int] &V, vector[unsigned int] &E) noexcept:
+    for i in range(G.order()):
+        V.push_back(i)
+
+    for u, v in G.edge_iterator(labels=False):
+        E.push_back(vertex_to_int[u])
+        E.push_back(vertex_to_int[v])
+
+
+cdef make_sage_decomp(G, vector[vector[int]] &V, vector[unsigned int] &E, int_to_vertex) noexcept:
+    cdef int i, j
+    for i in range(len(V)):
+        G.add_vertex(Set([int_to_vertex[j] for j in V[i]]))
+
+    for i in range(0, len(E), 2):
+        G.add_edge(Set([int_to_vertex[j] for j in V[E[i]]]), Set([int_to_vertex[j] for j in V[E[i+1]]]))
+
+
+##############################################################
+# ########## EXACT ALGORITHMS ################################
+
+def treedecomposition_exact(G, lb=-1):
+    r"""
+    Compute a tree decomposition of exact width.
+
+    The returned tree decomposition is exact iff the given lower bound is not
+    greater than the treewidth of the input graph. Otherwise a tree
+    decomposition of a width than matches the given lower bound will be
+    computed.
+
+    INPUT:
+
+    - ``G`` -- a generic graph
+
+    - ``lb`` -- integer (default: -1); a lower bound to the treewidth of G,
+      e.g. computed by lower_bound
+
+    OUTPUT:
+
+    A tree decomposition of ``G`` of ``tw(G)``, if the lower bound was not
+    greater than ``tw(G)``, otherwise a tree decomposition of ``width = lb``.
+
+    .. WARNING::
+
+        The computation can take a lot of time for a graph `G` on more than
+        about 30 vertices and `tw(G) > 3`.
+
+    EXAMPLES::
+
+        sage: # optional - tdlib
+        sage: import sage.graphs.graph_decompositions.tdlib as tdlib
+        sage: G = graphs.HouseGraph()
+        sage: T = tdlib.treedecomposition_exact(G)
+        sage: T.show(vertex_size=2000)                                                  # needs sage.plot
+
+    TESTS::
+
+        sage: # optional - tdlib
+        sage: import sage.graphs.graph_decompositions.tdlib as tdlib
+        sage: G = graphs.HouseGraph()
+        sage: T = tdlib.treedecomposition_exact(G)
+        sage: G = graphs.PetersenGraph()
+        sage: T = tdlib.treedecomposition_exact(G)
+    """
+    cdef vector[unsigned int] V_G, E_G, E_T
+    cdef vector[vector[int]] V_T
+
+    cdef list int_to_vertex = list(G)
+    cdef dict vertex_to_int = {v: i for i, v in enumerate(G)}
+
+    make_tdlib_graph(G, vertex_to_int, V_G, E_G)
+
+    cdef int c_lb = lb
+
+    sig_on()
+    sage_exact_decomposition(V_G, E_G, V_T, E_T, c_lb)
+    sig_off()
+
+    T = Graph(name="Tree decomposition")
+    make_sage_decomp(T, V_T, E_T, int_to_vertex)
+
+    return T
+
+
+def get_width(T):
+    """
+    Return the width of a given tree decomposition.
+
+    The width of a tree decompositions is the maximal size of a bag minus one.
+
+    INPUT:
+
+    - ``T`` -- a tree decomposition
+
+    OUTPUT: the width of ``T``
+
+    EXAMPLES::
+
+        sage: # optional - tdlib
+        sage: import sage.graphs.graph_decompositions.tdlib as tdlib
+        sage: G = graphs.PetersenGraph()
+        sage: T = tdlib.treedecomposition_exact(G)
+        sage: tdlib.get_width(T)
+        4
+    """
+    return (max(len(x) for x in T) - 1) if T else -1