depth first traversal graph java
public void depthFirstSearch(Node node) { node.visit(); System.out.print(node.name + " "); LinkedList<Node> allNeighbors = adjacencyMap.get(node); if (allNeighbors == null) return; for (Node neighbor : allNeighbors) { if (!neighbor.isVisited()) depthFirstSearch(neighbor); } }