Interface IOpenSet

All Known Implementing Classes:
BinaryHeapOpenSet

public interface IOpenSet
An open set for A* or similar graph search algorithm
  • Method Summary

    Modifier and Type
    Method
    Description
    void
    Inserts the specified node into the heap
    boolean
     
    Removes and returns the minimum element in the heap.
    void
    A faster path has been found to this node, decreasing its cost.
  • Method Details

    • insert

      void insert(PathNode node)
      Inserts the specified node into the heap
      Parameters:
      node - The node
    • isEmpty

      boolean isEmpty()
      Returns:
      true if the heap has no elements; false otherwise.
    • removeLowest

      PathNode removeLowest()
      Removes and returns the minimum element in the heap.
      Returns:
      The minimum element in the heap
    • update

      void update(PathNode node)
      A faster path has been found to this node, decreasing its cost. Perform a decrease-key operation.
      Parameters:
      node - The node