Question

我有这个代码，我想实现对深度的限制，我该如何实现呢？我可以以某种方式存储当前深度并将其与给定限制进行比较吗？如果是这样，我该怎么做？感谢。

import java.util.List;
import java.util.ArrayList;
import java.util.Stack;


interface GoalFunction<T>
{
    boolean evaluate(Vertex<T> o);
}

public class Vertex<T>
{

    private final T data;
    private final List<Vertex<T>> _successors = new ArrayList<Vertex<T>>();

    Vertex(T data) { this.data = data; }
    T getData() { return data; }
    List<Vertex<T>> successors() { return _successors; }

    public static <T> boolean depthFirstSearch(Vertex<T> start,
                                               GoalFunction<T> isGoal,
                                               Stack<Vertex<T>> result)
    {
        if (result.contains(start))
    {
        return false;
    }

        result.push(start);

        if (isGoal.evaluate(start))
    {
        return true;
    }
        for (Vertex<T> v : start.successors()) {
        if (depthFirstSearch(v, isGoal, result))
        {
            return true;
        }
    }

        // No path was found
        result.pop();
        return false; 
    }

    public static List<Vertex<Integer>> petersenGraph()
    {
        List<Vertex<Integer>> v = new ArrayList<Vertex<Integer>>();
        for (int i = 0; i < 10; i++)
        {
            v.add(new Vertex<Integer>(i));
        }
        int[][] edges =
        {{0,1}, {1,0}, {1,2}, {2,1}, {2,3}, {3,2}, {3,4}, {4,3}, {4,0}, {0,4},
         {5,6}, {6,5}, {6,7}, {7,6}, {7,8}, {8,7}, {8,9}, {9,8}, {9,5}, {5,9},
         {5,0}, {0,5}, {6,2}, {2,6}, {7,4}, {4,7}, {8,1}, {1,8}, {9,3}, {3,9}};
    for (int[] e : edges)
    {
        v.get(e[0]).successors().add(v.get(e[1]));
    }

        return v;
    }

    public static void main(String[] args)
    {
        List<Vertex<Integer>> v = petersenGraph();
        Stack<Vertex<Integer>> path = new Stack<Vertex<Integer>>();
        if (depthFirstSearch(v.get(0), new GoalFunction<Integer>() {
            public boolean evaluate(Vertex<Integer> v)
            {
                return v.getData() == 7;
            }
        }, path))
        {
            System.out.print("Found path: ");
            for (Vertex<Integer> u : path)
            {
                System.out.print(u.getData() + " ");
            }
            System.out.println();
        }
        else
        {
            System.out.println("No path found");
        }
    }

}

Answer 1

使用递归重新实现您的DFS。将递增值传递给DFS的递归函数：

   void recursive(int depth, .. parameters) {
     if (depth > CUT_OFF)
       return;
     ..        
     recursive(depth+1, parameters1);
     recursive(depth+1, parameters2);
   }

然后你知道当前的深度，可以在任何级别打破它。

在DFS中的某个深度处实施截止

1 个答案: