public DefaultLightestClauseHeuristic()
{
c = new LightestClauseSorter();
sos = CollectionFactory.CreatePriorityQueue <Clause>(c);
}
/**
* Constructs a best first search from a specified search problem and
* evaluation function.
*
* @param impl
* a search space exploration strategy.
* @param evalFn
* an evaluation function, which returns a number purporting to
* describe the desirability (or lack thereof) of expanding a
* node.
*/
public BestFirstSearch(QueueSearch <S, A> impl, IToDoubleFunction <Node <S, A> > evalFn)
: base(impl, CollectionFactory.CreatePriorityQueue <Node <S, A> >(new BestFirstSearchComparer(evalFn)))
{
this.evalFn = evalFn;
}
/**
* Combines UniformCostSearch queue definition with the specified
* search space exploration strategy.
*/
public UniformCostSearch(QueueSearch <S, A> impl)
: base(impl, CollectionFactory.CreatePriorityQueue <Node <S, A> >(new UniformCostSearchComparer()))
{
}
