Metadata-Version: 2.4
Name: link-khovanov
Version: 0.1.0
Summary: solve khovanov for link for both directions of each component.
License: MIT
License-File: LICENSE
Author: GGN_2015
Author-email: neko@jlulug.org
Requires-Python: >=3.10
Classifier: License :: OSI Approved :: MIT License
Classifier: Programming Language :: Python :: 3
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
Requires-Dist: javakh-interface (>=0.2.0)
Requires-Dist: pd-code-components (>=0.1.0)
Requires-Dist: pd-code-connected-sum (>=0.1.0)
Requires-Dist: pd-code-reverse-component (>=0.1.0)
Requires-Dist: pd-code-sanity (>=0.1.0)
Description-Content-Type: text/markdown

# link-khovanov

Compute distinct Khovanov values over all component orientations.

## Installation

```bash
pip install link-khovanov
```

## Quick start

`from link_khovanov import link_khovanov` then `link_khovanov(pd_code)`.

PD codes are lists of four-entry crossings. Each arc label must occur exactly twice. Functions validate their inputs and do not mutate caller-owned PD-code lists unless explicitly documented.

## Development

Use Python 3.10 or newer for Python packages. Build distributions with `poetry build`. Run the package's tests or examples before publishing. C++ projects require a modern standards-compliant compiler.

## License

MIT. See `LICENSE`.

