final double totalCost = currCost + travelCost; if (totalCost < nCost) { revisitNode(n, data, pendingNodes, currTime + travelTime, totalCost, l); return true; } else if (totalCost == nCost) { revisitNode(n, data, pendingNodes, currTime + travelTime, totalCost, l); return true;