Update StronglyConnectedComponentOptimized.java

Author: vickygit-commits

src/main/java/com/thealgorithms/graph/StronglyConnectedComponentOptimized.java

@@ -3,6 +3,7 @@
 import java.util.HashMap;
 import java.util.List;
 import java.util.Stack;
+
 /**
  * Finds the strongly connected components in a directed graph.
  *
@@ -25,11 +26,11 @@ public void btrack(HashMap<Integer, List<Integer>> adjList, int[] visited, Stack
         }
         dfsCallsNodes.add(currentNode);
     }
-    
+
     public void btrack2(HashMap<Integer, List<Integer>> adjRevList, int[] visited, int currentNode, List<Integer> newScc) {
         visited[currentNode] = 1;
         newScc.add(currentNode);
-        List<Integer> neighbors = adjRevList.get(currentNode);        
+        List<Integer> neighbors = adjRevList.get(currentNode);
         // Check for null before iterating
         if (neighbors != null) {
             for (int neighbor : neighbors) {
@@ -39,7 +40,6 @@ public void btrack2(HashMap<Integer, List<Integer>> adjRevList, int[] visited, i
             }
         }
     }
-    
 
     public int getOutput(HashMap<Integer, List<Integer>> adjList, int n) {
         int[] visited = new int[n];