（DFS）深度优先搜索模板（Java代码）

来自 https://leetcode-cn.com/explore/learn/card/queue-stack/219/stack-and-dfs/882/

/*
 * Return true if there is a path from cur to target.
 */
boolean DFS(Node cur, Node target, Set<Node> visited) {
    return true if cur is target;
    for (next : each neighbor of cur) {
        if (next is not in visited) {
            add next to visted;
            return true if DFS(next, target, visited) == true;
        }
    }
    return false;
}