mirror of
https://github.com/bertptrs/adventofcode.git
synced 2025-12-25 21:00:31 +01:00
Bert Peters
48824288b0
Is using networkx cheating? I don't think so. I've already solved max-clique before, so I know I can do it
28 lines
418 B
TOML
28 lines
418 B
TOML
[project]
|
|
name = "aoc-2024"
|
|
version = "0.1.0"
|
|
description = "Advent of Code 2024 solutions programs"
|
|
readme = "README.md"
|
|
requires-python = ">=3.12"
|
|
dependencies = [
|
|
"click>=8.1.7",
|
|
"networkx>=3.4.2",
|
|
"numpy>=2.1.2",
|
|
]
|
|
|
|
[dependency-groups]
|
|
dev = [
|
|
"mypy>=1.13.0",
|
|
"pytest>=8.3.3",
|
|
"ruff>=0.7.3",
|
|
]
|
|
|
|
[tool.uv]
|
|
package = true
|
|
|
|
[tool.ruff.lint]
|
|
select = ["F", "E", "I"]
|
|
|
|
[tool.mypy]
|
|
strict = true
|