passagemath-rankwidth 10.5.45

passagemath: Rankwidth and rank decompositions of graphs with rw

passagemath is open source mathematical software in Python, released under the GNU General Public Licence GPLv2+.

It is a fork of SageMath, 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:

• providing modularized installation with pip, thus completing a major project started in 2020 in the Sage codebase,

• establishing first-class membership in the scientific Python ecosystem,

• giving clear attribution of upstream projects,

• providing independently usable Python interfaces to upstream libraries,

• providing platform portability and integration testing services to upstream projects,

• inviting collaborations with upstream projects,

• building a professional, respectful, inclusive community,

• developing a port to Pyodide for serverless deployment with Javascript,

• developing a native Windows port.

Full documentation 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.

Complete sets of binary wheels are provided on PyPI for Python versions 3.9.x-3.12.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.

About this pip-installable distribution package

This pip-installable distribution passagemath-rankwidth is a small optional distribution for use with passagemath-graphs.

It provides a Cython interface to rw by Philipp Klaus Krause, which calculates rank width and rank decompositions.

What is included

• Cython interface to rw

Examples

$ pipx run --pip-args="--prefer-binary" --spec "passagemath-rankwidth[test]" ipython

In [1]: from sage.all__sagemath_rankwidth import *

In [2]: g = graphs.PetersenGraph()

In [3]: g.rank_decomposition()
Out[3]: (3, Graph on 19 vertices)