一个独立于领域的最佳优先搜索使用基于策略的模板方法模式设计实现C++头库。

Note: This project really should be called "best-first search". The policy referred to is the design pattern policy (aka strategy), not the automated planning policy. Although there are existing best-first search/A* implementations in C++, I couldn"t find one that exactly fit my requirements. Boost looks powerful but very complicated given the conceptual overhead of the BGL. Others were generally old-fashioned or unmaintained. This implementation is: * modern: it utilizes C++11 and policy-based design. * domain-independent: it implements the Template Method pattern (with policy classes rather than subclasses) to abstract the problem from the search algorithm. * canonical: it models search according to the definition in AIMA. * efficient