Format Java files with clang-format

Author: the-yash-rajput

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

@@ -21,8 +21,8 @@ public class TopologicalSort {
      * manipulating the graph
      */
     public static class Graph {
-        private final int n;                              // Number of nodes
-        private final List<List<Integer>> adj;            // Adjacency list representation
+        private final int n; // Number of nodes
+        private final List<List<Integer>> adj; // Adjacency list representation
 
         /**
          * Constructor for the Graph class
@@ -71,8 +71,7 @@ public int getNumNodes() {
      * @param stack Stack containing the vertices for topological sorting
      * @return true if cycle is detected, false otherwise
      */
-    private static boolean dfs(int v, boolean[] visited, boolean[] recStack,
-                               List<List<Integer>> graph, Stack<Integer> stack) {
+    private static boolean dfs(int v, boolean[] visited, boolean[] recStack, List<List<Integer>> graph, Stack<Integer> stack) {
         visited[v] = true;
         recStack[v] = true;
 
@@ -120,5 +119,4 @@ public static List<Integer> sort(Graph g) {
 
         return ans;
     }
-
-}
+}

src/test/java/com/thealgorithms/graph/TopologicalSortTest.java

@@ -1,11 +1,11 @@
 package com.thealgorithms.graph;
 
-import org.junit.jupiter.api.Test;
-import org.junit.jupiter.api.DisplayName;
 import static org.junit.jupiter.api.Assertions.*;
 
 import java.util.Arrays;
 import java.util.List;
+import org.junit.jupiter.api.DisplayName;
+import org.junit.jupiter.api.Test;
 
 /**
  * Test class for TopologicalSort
@@ -326,17 +326,12 @@ void testCycleDetection() {
         TopologicalSort.Graph graph = new TopologicalSort.Graph(3);
         graph.addEdge(0, 1);
         graph.addEdge(1, 2);
-        graph.addEdge(2, 0);  // Creates a cycle: 0 -> 1 -> 2 -> 0
+        graph.addEdge(2, 0); // Creates a cycle: 0 -> 1 -> 2 -> 0
 
         // With the fixed code, this should now throw an exception
-        IllegalArgumentException exception = assertThrows(
-                IllegalArgumentException.class,
-                () -> TopologicalSort.sort(graph),
-                "Topological sort should detect cycle and throw IllegalArgumentException"
-        );
+        IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> TopologicalSort.sort(graph), "Topological sort should detect cycle and throw IllegalArgumentException");
 
         // Verify the exception message
         assertEquals("cycle detected in graph", exception.getMessage());
     }
-
-}
+}