fix: Apply clang-format

Author: sairamsharan

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

@@ -1,6 +1,5 @@
 package com.thealgorithms.graph;
 
-
 /**
  * An implementation of the Stoer-Wagner algorithm to find the global minimum cut of an undirected, weighted graph.
  * A minimum cut is a partition of the graph's vertices into two disjoint sets with the minimum possible edge weight