Interface IOpenSet
- All Known Implementing Classes:
BinaryHeapOpenSet
public interface IOpenSet
An open set for A* or similar graph search algorithm
-
Method Summary
-
Method Details
-
insert
-
isEmpty
boolean isEmpty()- Returns:
trueif the heap has no elements;falseotherwise.
-
removeLowest
PathNode removeLowest()Removes and returns the minimum element in the heap.- Returns:
- The minimum element in the heap
-
update
A faster path has been found to this node, decreasing its cost. Perform a decrease-key operation.- Parameters:
node- The node
-