mirror of
https://github.com/bertptrs/adventofcode.git
synced 2025-12-25 12:50:32 +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
12 lines
235 B
Python
12 lines
235 B
Python
from aoc.days.day23 import DayRunner
|
|
|
|
from . import get_data
|
|
|
|
|
|
def test_sample_part1() -> None:
|
|
assert DayRunner.part1(get_data(23)) == 7
|
|
|
|
|
|
def test_sample_part2() -> None:
|
|
assert DayRunner.part2(get_data(23)) == "co,de,ka,ta"
|