day 25 was a graph problem, i used petgraph to solve it, checked out the reddit solutions
the algorithm needed to solve the problem is Stoer–Wagner algorithm, it helps you determine the minimum number edges you need to cut to turn a graph into two disjointed loops.
if i learned one thing from this year's advent of code, it's that i don't know anything about graph theory, if any of you have a good resource for learning it, please share it in the comments
[part 1 solution]
the algorithm needed to solve the problem is Stoer–Wagner algorithm, it helps you determine the minimum number edges you need to cut to turn a graph into two disjointed loops.
if i learned one thing from this year's advent of code, it's that i don't know anything about graph theory, if any of you have a good resource for learning it, please share it in the comments
[part 1 solution]