dedap 2026.4

Topological sorting and transitive reduction algorithms

dedap-python

dedap implements transitive reduction for directed acyclic graphs. DAGs are used for scheduling operations, and transitive reduction produces equivalent DAGs sans redundant links.

The module is only dependent on the Python standard library for normal use. It does need external modules for building the installable package, for checking static type consistency, and for building the documentation.

Installation

On Windows:

py -m pip install --upgrade pip
py -m pip install dedap

On other systems (e.g., Linux, macOS):

python3 -m pip install --upgrade pip
python3 -m pip install dedap

Testing

This module has doctest-style unit tests within its docstrings.

To run this module's tests from the source directory:

python3 -m doctest dedap/dedap.py

To run this module's tests after installation:

python3 -m doctest dedap/dedap.py

To check the static type consistency, use mypy if it's available:

mypy dedap/dedap.py

Documentation

To build the HTML documentation:

make -C doc html

To build the PDF documentation (assuming all LaTeX dependencies are installed):

make -C doc latexpdf

Future

• Bind C++ dedap library into this Python package. Call it cdedap.

  • Write benchmark tests to compare the C++-based implementation (cdedap) to the pure Python implementation.