Solve day 25 puzzle

Author: Flashky

README.md

@@ -27,7 +27,7 @@
 - [Day 22](https://github.com/Flashky/advent-of-code-2023/tree/master/src/main/java/com/adventofcode/flashk/day22)
 - [Day 23](https://github.com/Flashky/advent-of-code-2023/tree/master/src/main/java/com/adventofcode/flashk/day23)
 - [Day 24](https://github.com/Flashky/advent-of-code-2023/tree/master/src/main/java/com/adventofcode/flashk/day24)
-- [Day 25](https://github.com/Flashky/advent-of-code-2023/tree/master/src/main/java/com/adventofcode/flashk/day25)
+- [Day 25 - Snowverload](https://github.com/Flashky/advent-of-code-2023/tree/master/src/main/java/com/adventofcode/flashk/day25)
 
 ## Cloning this repository
 

pom.xml

@@ -52,6 +52,11 @@
 			<artifactId>jgrapht-core</artifactId>
 			<version>1.5.2</version>
 		</dependency>
+		<dependency>
+			<groupId>org.jgrapht</groupId>
+			<artifactId>jgrapht-ext</artifactId>
+			<version>1.5.2</version>
+		</dependency>
 		<!-- JSON management -->
   		<dependency>
 			<groupId>com.fasterxml.jackson.core</groupId>

src/main/java/com/adventofcode/flashk/day25/README.md

@@ -1,3 +1,3 @@
-# Day 25
+# Day 25: Snowverload
 
 [https://adventofcode.com/2023/day/25](https://adventofcode.com/2023/day/25)

src/main/java/com/adventofcode/flashk/day25/Snowverload.java

@@ -0,0 +1,41 @@
+package com.adventofcode.flashk.day25;
+
+import org.apache.commons.lang3.StringUtils;
+import org.jgrapht.Graph;
+import org.jgrapht.alg.StoerWagnerMinimumCut;
+import org.jgrapht.graph.DefaultEdge;
+import org.jgrapht.graph.SimpleGraph;
+
+import java.util.List;
+
+public class Snowverload {
+
+    private final Graph<String, DefaultEdge> graph = new SimpleGraph<>(DefaultEdge.class);
+
+    public Snowverload(List<String> inputs) {
+
+        for(String input : inputs) {
+            String[] inputParts = input.split(":");
+            String leftVertex = inputParts[0];
+            String[] rightVertexes = inputParts[1].stripLeading().split(StringUtils.SPACE);
+
+            graph.addVertex(leftVertex);
+            for(String rightVertex : rightVertexes) {
+                graph.addVertex(rightVertex);
+            }
+        }
+
+    }
+
+    public int solve() {
+
+        StoerWagnerMinimumCut<String,DefaultEdge> minCut = new StoerWagnerMinimumCut<>(graph);
+
+        int totalVertexes = graph.vertexSet().size();
+        int cutSize = minCut.minCut().size();
+        int remainingSize = totalVertexes - cutSize;
+
+        return cutSize * remainingSize;
+    }
+
+}

src/test/java/com/adventofcode/flashk/day25/Day25Test.java

@@ -19,9 +19,10 @@
 import com.adventofcode.flashk.common.test.utils.Timer;
 import com.adventofcode.flashk.common.test.utils.Input;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 @DisplayName(TestDisplayName.DAY_25)
 @TestMethodOrder(OrderAnnotation.class)
-@Disabled // TODO Remove comment when implemented
 public class Day25Test extends PuzzleTest {
 
 	private final static String INPUT_FOLDER = TestFolder.DAY_25;
@@ -43,6 +44,12 @@ public void testSolvePart1Sample() {
 
 		// Read input file
 		List<String> inputs = Input.readStringLines(INPUT_FOLDER, TestFilename.INPUT_FILE_SAMPLE);
+
+		Snowverload snowverload = new Snowverload(inputs);
+		int result = snowverload.solve();
+
+		assertEquals(54, result);
+
 
 	}
 
@@ -57,14 +64,19 @@ public void testSolvePart1Input() {
 
 		// Read input file
 		List<String> inputs = Input.readStringLines(INPUT_FOLDER, TestFilename.INPUT_FILE);
-		
+
+		Snowverload snowverload = new Snowverload(inputs);
+		int result = snowverload.solve();
+
+		assertEquals(548960, result);
 	}
 
 	@Test
 	@Order(3)
 	@Tag(TestTag.PART_TWO)
 	@Tag(TestTag.SAMPLE)
 	@DisplayName(TestDisplayName.PART_TWO_SAMPLE)
+	@Disabled
 	public void testSolvePart2Sample() {
 
 		System.out.print("2 | sample | ");
@@ -79,6 +91,7 @@ public void testSolvePart2Sample() {
 	@Tag(TestTag.PART_TWO)
 	@Tag(TestTag.INPUT)
 	@DisplayName(TestDisplayName.PART_TWO_INPUT)
+	@Disabled
 	public void testSolvePart2Input() {
 
 		System.out.print("2 | input  | ");