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