Style: format TopologicalSort.java using clang-format

Author: Saipatnaik-23

src/main/java/com/thealgorithms/graphsearch/TopologicalSort.java

@@ -20,19 +20,19 @@ public class TopologicalSort {
     public static void main(String[] args) {
         int v = 6;
         ArrayList<ArrayList<Integer>> adjList = new ArrayList<>();
-        for(int i=0; i<v; i++){
+        for (int i = 0; i < v; i++) {
             adjList.add(new ArrayList<>());
         }
 
-        //sample DAG edges
+        // sample DAG edges
         adjList.get(5).add(2);
         adjList.get(5).add(0);
         adjList.get(4).add(0);
         adjList.get(4).add(1);
         adjList.get(2).add(3);
         adjList.get(3).add(1);
 
-        topoSort(v,adjList);
+        topoSort(v, adjList);
     }
 
     /**
@@ -43,20 +43,19 @@ public static void main(String[] args) {
      * @param adjList adjacency list representing the graph
      */
 
-
-    public static void topoSort (int v, ArrayList<ArrayList<Integer>> adjList){
-        boolean []  visited = new boolean[v];
-        Stack <Integer> stack = new Stack<>();
+    public static void topoSort(int v, ArrayList<ArrayList<Integer>> adjList) {
+        boolean[] visited = new boolean[v];
+        Stack<Integer> stack = new Stack<>();
 
         for (int i = 0; i < v; i++) {
-            if(!visited[i]){
-                topoSortUtil(i,visited,stack,adjList);
+            if (!visited[i]) {
+                topoSortUtil(i, visited, stack, adjList);
             }
         }
 
         System.out.println("Topological Sort:");
-        while (!stack.isEmpty()){
-            System.out.print(stack.pop()+" ");
+        while (!stack.isEmpty()) {
+            System.out.print(stack.pop() + " ");
         }
         System.out.println();
     }
@@ -72,12 +71,12 @@ public static void topoSort (int v, ArrayList<ArrayList<Integer>> adjList){
      *
      */
 
-    public static void topoSortUtil(int node, boolean[] visited, Stack<Integer> stack, ArrayList<ArrayList<Integer>> adjList){
+    public static void topoSortUtil(int node, boolean[] visited, Stack<Integer> stack, ArrayList<ArrayList<Integer>> adjList) {
         visited[node] = true;
 
-        for(int neighbour : adjList.get(node)){
-            if(!visited[neighbour]){
-                topoSortUtil(neighbour,visited,stack,adjList);
+        for (int neighbour : adjList.get(node)) {
+            if (!visited[neighbour]) {
+                topoSortUtil(neighbour, visited, stack, adjList);
             }
         }
         stack.push(node); // add to stack after visiting all edges