Java深度优先搜索
static Set<Node> markSet = new HashSet<>();
private static void dfs(Node node){
if (markSet.contains(node)){
return;
}
System.out.print(node.getName() + "->");
markSet.add(node);
for (Node n : node.getChild()) {
dfs(n);
}
}