return to; if (heap.isEmpty() || isMaxVisitedNodesExceeded()) return NOT_FOUND; if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;
return to; if (heap.isEmpty() || isMaxVisitedNodesExceeded()) return NOT_FOUND; if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;
return to; if (heap.isEmpty() || isMaxVisitedNodesExceeded()) return NOT_FOUND; if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;
return to; if (heap.isEmpty() || isMaxVisitedNodesExceeded()) return NOT_FOUND; if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;