@@ -0,0 +1,692 @@
+package io.nnyy.algorithms.graph;%0A%0Apublic class FindEulerPath%0A%7B%0A    public void findEulerPath(HashMap%3CString, Queue%3CString%3E%3E adjList)%0A    %7B%0A        if (adjList == null) return;%0A%0A        LinkedList%3CString%3E ll = new LinkedList%3C%3E();%0A        for (String node : adjList.keySet()) dfs(adjList, ll, node);%0A    %7D%0A%0A    private void dfs(%0A            HashMap%3CString, Queue%3CString%3E%3E adjList,%0A            LinkedList%3CString%3E ll,%0A            String currNode)%0A    %7B%0A        Queue%3CString%3E neighbors = adjList.get(currNode);%0A%0A        while (neighbors.size() %3E 0)%0A        %7B%0A            String neighbor = neighbors.poll();%0A            dfs(adjList, ll, neighbor);%0A        %7D%0A%0A        ll.addFirst(currNode);%0A    %7D%0A%7D

Add implementation of Finding Euler Path