private final QueueSearch implementation;
private final Comparator<Node> comparator;
public PrioritySearch(QueueSearch impl, Comparator<Node> comp) {
implementation = impl;
comparator = comp;
<BUG>}
public List<Action> search(Problem p) {</BUG>
return implementation.search(p, QueueFactory.<Node>createPriorityQueue(comparator));
}
public Comparator<Node> getComparator() {

private final QueueSearch implementation;
private final Comparator<Node> comparator;
public PrioritySearch(QueueSearch impl, Comparator<Node> comp) {
implementation = impl;
comparator = comp;
}
@Override
public List<Action> search(Problem p) {
return implementation.search(p, QueueFactory.<Node>createPriorityQueue(comparator));
}
public Comparator<Node> getComparator() {
