I placed 5th overall. I finished two points behind #4 and 8 points ahead of #6; very close race!
I'm a little sad to have reached for a library (networkx) today to solve the problem rather than doing it myself. But I'm also sad to have not reached for the library sooner :) Is there a nicer solution that takes advantage of the guarantee that the min cut is size 3?
Problem: https://adventofcode.com/2023/day/25
Solution: https://github.com/jonathanpaulson/Ad...