Hierarchy For Package search

Package Hierarchies:

• All Packages

Class Hierarchy

• java.lang.Object
  • search.ExploredSets
  • search.Frontiers
  • search.Frontiers.DebuggingFrontier<Node> (implements search.FrontierStructure<Node>)
    • search.Frontiers.DebuggablePriorityQueue<S,N>
    • search.Frontiers.PriorityQueue<Node>
      • search.Frontiers.StateKeyedPriorityQueue<S,N>
  • search.Frontiers.Queue<Node> (implements search.FrontierCheckingStructure<Node>)
  • search.GoalCheckers
  • search.GraphSearcher<State,Node,Frontier>
    • search.BreadthFirstSearcher<State,Node>
    • search.PriorityQueueSearcher<State,Node,Frontier>
      • search.AStarFrontierSearcher<State,Node,Frontier>
        • search.AStarFrontierSearcher.PathNodes<State,Frontier>
        • search.AStarFrontierSearcher.SimpleNodes<State,Frontier>
        • search.AStarSearcher<State,Node>
          • search.AStarSearcher.PathNodes<State>
          • search.AStarSearcher.SimpleNodes<State>
  • search.Nodes
  • search.Nodes.CostAndStep<S>
  • search.Nodes.SimpleTreeCostNode<S>
  • search.Nodes.SimpleTreeNode<S>
  • search.Nodes.SimpleTreePathCostNode<S>
  • search.Nodes.SimpleTreePathNode<S>
  • java.lang.Throwable (implements java.io.Serializable)
    • java.lang.Exception
      • java.lang.RuntimeException
        • java.lang.IllegalStateException
          • search.FrontierEmptyException
      • search.SearchFailureException

Interface Hierarchy

• search.ExploredSet<Node>
• search.FrontierStructure<Node>
  • search.FrontierCheckingStructure<Node>
• search.KnowsOwnCost
• java.util.function.Predicate<T>
  • search.GoalChecker<Node>
• search.SearchTreeNode<Self,State>
  • search.SearchTreePathNode<This,S>