Removing redundant access modifiers.

Author: MuhammadEzzatHBK

src/main/java/com/thealgorithms/randomized/KargerMinCut.java

@@ -76,15 +76,17 @@ public static KargerOutput findMinCut(Collection<Integer> nodeSet, List<int[]> e
 
     private static class DisjointSetUnion {
         private final int[] parent;
-        public int setCount;
+        int setCount;
 
-        public DisjointSetUnion(int size) {
+        DisjointSetUnion(int size) {
             parent = new int[size];
-            for (int i = 0; i < size; i++) parent[i] = i;
+            for (int i = 0; i < size; i++) {
+                parent[i] = i;
+            }
             setCount = size;
         }
 
-        public int find(int i) {
+        int find(int i) {
             // If it's not its own parent, then it's not the root of its set
             if (parent[i] != i) {
                 // Recursively find the root of its parent
@@ -96,7 +98,7 @@ public int find(int i) {
             return parent[i];
         }
 
-        public void union(int u, int v) {
+        void union(int u, int v) {
             // Find the root of each node
             int rootU = find(u);
             int rootV = find(v);
@@ -111,15 +113,15 @@ public void union(int u, int v) {
             }
         }
 
-        public boolean inSameSet(int u, int v) {
+        boolean inSameSet(int u, int v) {
             return find(u) == find(v);
         }
 
         /*
           This is a verbosity method, it's not a part of the core algorithm,
           But it helps us provide more useful output.
         */
-        public Set<Integer> getAnySet() {
+        Set<Integer> getAnySet() {
             int aRoot = find(0); // Get one of the two roots
 
             Set<Integer> set = new HashSet<>();
@@ -137,19 +139,19 @@ private static class Graph {
         private final List<Integer> nodes;
         private final List<int[]> edges;
 
-        public Graph(Collection<Integer> nodeSet, List<int[]> edges) {
+        Graph(Collection<Integer> nodeSet, List<int[]> edges) {
             this.nodes = new ArrayList<>(nodeSet);
             this.edges = new ArrayList<>();
             for (int[] e : edges) {
                 this.edges.add(new int[] {e[0], e[1]});
             }
         }
 
-        public Graph copy() {
+        Graph copy() {
             return new Graph(this.nodes, this.edges);
         }
 
-        public KargerOutput findMinCut() {
+        KargerOutput findMinCut() {
             DisjointSetUnion dsu = new DisjointSetUnion(nodes.size());
             List<int[]> workingEdges = new ArrayList<>(edges);