pyproject.toml

# SPDX-License-Identifier: MIT
[project]
name = "goemans-gap"
version = "0.1.0"
description = "Reproducibility suite for the Rybin-digraph extremal theorem for Goemans's cost conjecture"
readme = "README.md"
authors = [{ name = "A. Richard Caputo III", email = "rcaputo3@tjclp.com" }]
requires-python = ">=3.11,<3.15"
license = "MIT"
license-files = ["LICENSE"]
keywords = ["combinatorial-optimization", "formal-verification", "lean4", "unsplittable-flow"]
classifiers = [
    "Development Status :: 3 - Alpha",
    "Intended Audience :: Science/Research",
    "Programming Language :: Python :: 3",
    "Topic :: Scientific/Engineering :: Mathematics",
]
dependencies = [
    # numba 0.66 requires numpy < 2.5; the jit-compiled vertex enumeration in
    # certify_sweep reproduces the archived transcript byte-for-byte and runs
    # the sweep about 4x faster than the batched-LAPACK formulation.
    "numba>=0.66",
    "numpy>=2.0,<2.5",
]

[project.urls]
Homepage = "https://github.com/TJC-LP/goemans"
Repository = "https://github.com/TJC-LP/goemans"
Issues = "https://github.com/TJC-LP/goemans/issues"

[project.scripts]
verify-goemans = "goemans_gap.cli:verify_goemans"
amplify-family = "goemans_gap.cli:amplify_family"
revision-checks = "goemans_gap.cli:revision_checks"
certify-sweep = "goemans_gap.cli:certify_sweep"
interval-search = "goemans_gap.cli:interval_search"
laned-search = "goemans_gap.cli:laned_search"

[dependency-groups]
dev = [
    "pytest>=8.0",
]

[build-system]
requires = ["uv_build>=0.11,<0.15"]
build-backend = "uv_build"

[tool.pytest.ini_options]
testpaths = ["tests"]
markers = ["slow: long-running search scripts (deselect with '-m \"not slow\"')"]
addopts = "-m 'not slow'"