@@ -0,0 +1,764 @@
+package io.nnyy.algorithms.graph;%0A%0Apublic class TopologicalSort%0A%7B%0A    public void topologicalSort(HashMap%3CString, List%3CString%3E%3E adjList)%0A    %7B%0A        if (adjList == null) return;%0A%0A        LinkedList%3CString%3E ll = new LinkedList%3C%3E();%0A        HashSet%3CString%3E visited = new HashSet%3C%3E();%0A%0A        for (String node : adjList.keySet()) dfs(adjList, ll, visited, node);%0A    %7D%0A%0A    public void dfs(%0A            HashMap%3CString, List%3CString%3E%3E adjList,%0A            LinkedList%3CString%3E ll,%0A            HashSet%3CString%3E visited,%0A            String currNode)%0A    %7B%0A        if (visited.contains(currNode)) return;%0A%0A        visited.add(currNode);%0A%0A        for (String neighborNode : adjList.get(currNode)) dfs(adjList, visited, neighborNode);%0A%0A        ll.addFirst(currNode);%0A    %7D%0A%7D

Add implementation for Topological Sort