Update MultistageGraph.java & MultistageGraphTest.java

Author: GouthamGuna

src/main/java/com/thealgorithms/datastructures/graphs/MultistageGraph.java

@@ -4,11 +4,10 @@
 import java.util.List;
 
 public final class MultistageGraph {
-    
+
     private MultistageGraph() {
-        
     }
-     private int k; // number of partitions (k > 2)
+    private int k; // number of partitions (k > 2)
 
     // Adjacency list to store edges between different stages
     public List<List<Integer>> adjacencyList;

src/test/java/com/thealgorithms/datastructures/graphs/MultistageGraphTest.java

@@ -7,47 +7,46 @@
 import java.io.PrintStream;
 import java.util.Arrays;
 import java.util.List;
-
 import org.junit.jupiter.api.Test;
 
 public class MultistageGraphTest {
 
-@Test
-public void testAddEdge_invalidFromStage() {
-    MultistageGraph graph = new MultistageGraph(3);
+    @Test
+    public void testAddEdge_invalidFromStage() {
+        MultistageGraph graph = new MultistageGraph(3);
 
-    assertThrows(IllegalArgumentException.class, () -> graph.addEdge(0, 2));
-}
+        assertThrows(IllegalArgumentException.class, () -> graph.addEdge(0, 2));
+    }
 
-@Test
-public void testAddEdge_invalidToStage() {
-    MultistageGraph graph = new MultistageGraph(3);
+    @Test
+    public void testAddEdge_invalidToStage() {
+        MultistageGraph graph = new MultistageGraph(3);
 
-    assertThrows(IllegalArgumentException.class, () -> graph.addEdge(1, 4));
-}
+        assertThrows(IllegalArgumentException.class, () -> graph.addEdge(1, 4));
+    }
 
-@Test
-public void testAddEdge_edgeAlreadyExists() {
-    MultistageGraph graph = new MultistageGraph(3);
+    @Test
+    public void testAddEdge_edgeAlreadyExists() {
+        MultistageGraph graph = new MultistageGraph(3);
 
-    graph.addEdge(1, 2);
-    graph.addEdge(1, 2); // Attempt to add the same edge again
+        graph.addEdge(1, 2);
+        graph.addEdge(1, 2); // Attempt to add the same edge again
 
-    List<Integer> expectedAdjacentStages = Arrays.asList(2);
-    assertEquals(expectedAdjacentStages, graph.adjacencyList.get(0));
-}
+        List<Integer> expectedAdjacentStages = Arrays.asList(2);
+        assertEquals(expectedAdjacentStages, graph.adjacencyList.get(0));
+    }
 
-@Test
-public void testAddEdge_printsSuccessMessage() {
-    MultistageGraph graph = new MultistageGraph(3);
+    @Test
+    public void testAddEdge_printsSuccessMessage() {
+        MultistageGraph graph = new MultistageGraph(3);
 
-    // Capture the standard output stream
-    ByteArrayOutputStream outputStreamCaptor = new ByteArrayOutputStream();
-    System.setOut(new PrintStream(outputStreamCaptor));
+        // Capture the standard output stream
+        ByteArrayOutputStream outputStreamCaptor = new ByteArrayOutputStream();
+        System.setOut(new PrintStream(outputStreamCaptor));
 
-    graph.addEdge(1, 2);
+        graph.addEdge(1, 2);
 
-    String expectedOutput = "Added edge between stage 1 and stage 2\r\n";
-    assertEquals(expectedOutput, outputStreamCaptor.toString());
-}
+        String expectedOutput = "Added edge between stage 1 and stage 2\r\n";
+        assertEquals(expectedOutput, outputStreamCaptor.toString());
+    }
 }