118119120121122123124125126127128
queue.insert(v, v.getWeight() + estimate); if (traverseVisitor != null) traverseVisitor.visitEnqueue(v); } } } spt.postVisit(u); } return spt; } public void setHeuristic(RemainingWeightHeuristic heuristic) {