Class DepthFirstSearch

java.lang.Object
fr.uga.pddl4j.planners.statespace.search.AbstractStateSpaceSearch
fr.uga.pddl4j.planners.statespace.search.DepthFirstSearch
All Implemented Interfaces:
SearchStrategy, StateSpaceSearch, Serializable

public final class DepthFirstSearch extends AbstractStateSpaceSearch
This class implements Depth First Search strategy.
See Also:
Serialized Form
  • Constructor Details

    • DepthFirstSearch

      public DepthFirstSearch()
      Creates a new Greedy best First Search search strategy with default parameters.
    • DepthFirstSearch

      public DepthFirstSearch(int timeout)
      Creates a new Greedy best First Search search strategy.
      Parameters:
      timeout - the time out of the planner.
  • Method Details

    • search

      public Node search(Problem codedProblem)
      The greedy best first search algorithm. Solves the planning problem and returns the first solution plan found. This method must be completed.
      Parameters:
      codedProblem - the problem to be solved. The problem cannot be null.
      Returns:
      a solution plan or null if it does not exist.