Fix: Checkstyle violations in Dinic and tests

Author: SamXop123

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

@@ -21,7 +21,7 @@
  * @see <a href="https://en.wikipedia.org/wiki/Dinic%27s_algorithm">Wikipedia: Dinic's algorithm</a>
  */
 public final class Dinic {
-  private Dinic() {}
+  private Dinic() { }
 
   /**
    * Computes the maximum flow from source to sink using Dinic's algorithm.
@@ -101,17 +101,19 @@ private static int dfsBlocking(
     }
     final int n = residual.length;
     for (int v = next[u]; v < n; v++, next[u] = v) {
-      if (residual[u][v] <= 0)
-        continue;
-      if (level[v] != level[u] + 1)
-        continue;
-      int pushed = dfsBlocking(residual, level, next, v, sink, Math.min(f, residual[u][v]));
-      if (pushed > 0) {
-        residual[u][v] -= pushed;
-        residual[v][u] += pushed;
-        return pushed;
-      }
-    }
-    return 0;
+            if (residual[u][v] <= 0) {
+                continue;
+            }
+            if (level[v] != level[u] + 1) {
+                continue;
+            }
+            int pushed = dfsBlocking(residual, level, next, v, sink, Math.min(f, residual[u][v]));
+            if (pushed > 0) {
+                residual[u][v] -= pushed;
+                residual[v][u] += pushed;
+                return pushed;
+            }
+        }
+return 0;
   }
 }

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

@@ -53,7 +53,8 @@ void parityWithEdmondsKarp() {
             }
           }
         }
-        int s = 0, t = n - 1;
+        int s = 0;
+        int t = n - 1;
         int f1 = Dinic.maxFlow(copyMatrix(cap), s, t);
         int f2 = EdmondsKarp.maxFlow(cap, s, t);
         assertEquals(f2, f1);