| Class | Description |
|---|---|
| AStar |
An implementation of A*.
|
| DynamicWeightedAStar |
Dynamic Weighted A* [1] uses a dynamic heuristic weight that is based on depth of the current search tree and based on an expected depth of the search.
|
| IDAStar |
Iteratively deepening A* implementation.
|
| StaticWeightedAStar |
Statically weighted A* [1] implementation.
|
| WeightedGreedy |
A weighted greedy search in which the g(n) function (the cost to the current node) is weighted by a fraction 0 <= w <= 1.
|