public void calcLeastCostPathTree(Node fromNode, double startTime) { this.fromNode = fromNode; this.startTime = startTime; augmentIterationId(); PseudoRemovePriorityQueue<Node> pendingNodes = new PseudoRemovePriorityQueue<Node>(500);// TODO other options?? initFromNode(fromNode, null, startTime, pendingNodes); while (!pendingNodes.isEmpty()) { relaxNode(pendingNodes.poll(), null, pendingNodes); } }