🎄 Add solution to 2023-12-25

Author: fuglede

2023/day25/solutions.py

@@ -0,0 +1,13 @@
+import networkx as nx
+
+with open("input") as f:
+    ls = f.read().strip().split("\n")
+
+G = nx.Graph()
+for l in ls:
+    v, *us = l.split()
+    G.add_edges_from((v[:-1], u) for u in us)
+
+G.remove_edges_from(nx.minimum_edge_cut(G))
+a, b = nx.connected_components(G)
+print(len(a) * len(b))