Added Hierholzer Algorith to find Eulerian Path

Author: crashmovies

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

@@ -1,6 +1,10 @@
 package com.thealgorithms.graph;
 
-import java.util.*;
+import java.util.List;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Deque;
+import java.util.ArrayDeque;
 
 /**
  * Implementation of Hierholzer's Algorithm for finding an Eulerian Path or Circuit
@@ -128,7 +132,8 @@ public List<Integer> findEulerianPath() {
 
         // Check degree differences to determine Eulerian path/circuit possibility
         int startNode = -1;
-        int startCount = 0, endCount = 0;
+        int startCount = 0;
+        int endCount = 0;
         for (int i = 0; i < n; i++) {
             int diff = outDegree[i] - inDegree[i];
             if (diff == 1) {

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

@@ -2,7 +2,9 @@
 
 import static org.junit.jupiter.api.Assertions.*;
 
-import java.util.*;
+import java.util.List;
+import java.util.Arrays;
+import java.util.Collections;
 import org.junit.jupiter.api.Test;
 
 /**