fix: adds checkstyle corrections

Author: guillermolara01

src/main/java/com/thealgorithms/greedyalgorithms/KruskalAlgorithm.java

@@ -54,7 +54,9 @@ public java.util.List<Edge> computeMST(Graph graph) {
                 mst.add(e);
                 ds.union(rootA, rootB);
 
-                if (mst.size() == graph.numberOfVertices - 1) break;
+                if (mst.size() == graph.numberOfVertices - 1) {
+                    break;
+                }
             }
         }
 
@@ -78,9 +80,15 @@ public Edge(int source, int target, int weight) {
             this.weight = weight;
         }
 
-        public int getSource() { return source; }
-        public int getTarget() { return target; }
-        public int getWeight() { return weight; }
+        public int getSource() {
+            return source;
+        }
+        public int getTarget() {
+            return target;
+        }
+        public int getWeight() {
+            return weight;
+        }
 
         @Override
         public int compareTo(Edge o) {
@@ -107,8 +115,7 @@ public Graph(int numberOfVertices) {
          * Adds an undirected edge to the graph.
          */
         public void addEdge(int source, int target, int weight) {
-            if (source < 0 || source >= numberOfVertices ||
-                    target < 0 || target >= numberOfVertices) {
+            if (source < 0 || source >= numberOfVertices || target < 0 || target >= numberOfVertices) {
                 throw new IndexOutOfBoundsException("Vertex index out of range.");
             }
 
@@ -127,7 +134,9 @@ private static final class DisjointSet {
         public DisjointSet(int size) {
             parent = new int[size];
             rank = new int[size];
-            for (int i = 0; i < size; i++) parent[i] = i;
+            for (int i = 0; i < size; i++) {
+                parent[i] = i;
+            }
         }
 
         public int find(int x) {
@@ -140,8 +149,9 @@ public int find(int x) {
         public void union(int a, int b) {
             int ra = find(a);
             int rb = find(b);
-            if (ra == rb) return;
-
+            if (ra == rb) {
+                return;
+            }
             if (rank[ra] < rank[rb]) {
                 parent[ra] = rb;
             } else if (rank[ra] > rank[rb]) {
@@ -152,5 +162,4 @@ public void union(int a, int b) {
             }
         }
     }
-}
-
+}

src/test/java/com/thealgorithms/greedyalgorithms/KruskalAlgorithmTest.java

@@ -2,10 +2,11 @@
 
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.api.DisplayName;
-
 import java.util.List;
-
-import static org.junit.jupiter.api.Assertions.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
 
 /**
  * Unit tests for the KruskalAlgorithm implementation.
@@ -70,7 +71,7 @@ void testParallelEdges() {
         KruskalAlgorithm.Graph graph = new KruskalAlgorithm.Graph(3);
 
         graph.addEdge(0, 1, 10);
-        graph.addEdge(0, 1, 3);   // cheaper parallel edge
+        graph.addEdge(0, 1, 3); // cheaper parallel edge
         graph.addEdge(1, 2, 4);
 
         KruskalAlgorithm algo = new KruskalAlgorithm();