protected Comparator<Node> getComparator()
{
Comparator<Node> f = new Comparator<Node>()
{
//public int compare(Node n1, Node n2) {
// Double f1 = evaluationFunction.f(n1);
// Double f2 = evaluationFunction.f(n2);
// return f1.compareTo(f2);
//}
};
if (this.search is GraphSearch)
{
((GraphSearch)this.search)
.setReplaceFrontierNodeAtStateCostFunction(f);
}
return f;
}
}