@Override public Path extractPath() { PathNative p = new PathNative(graph, weighting, parents, edgeIds); if (endNode >= 0) p.setWeight(weights[endNode]); p.setFromNode(fromNode); // return 'not found' if invalid endNode or limit reached if (endNode < 0 || isWeightLimitExceeded()) return p; return p.setEndNode(endNode).extract(); }
if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;
@Override public Path extractPath() { PathNative p = new PathNative(graph, weighting, parents, edgeIds); if (endNode >= 0) p.setWeight(weights[endNode]); p.setFromNode(fromNode); // return 'not found' if invalid endNode or limit reached if (endNode < 0 || isWeightLimitExceeded()) return p; return p.setEndNode(endNode).extract(); }
@Override public Path extractPath() { PathNative p = new PathNative(graph, weighting, parents, edgeIds); if (endNode >= 0) p.setWeight(weights[endNode]); p.setFromNode(fromNode); // return 'not found' if invalid endNode or limit reached if (endNode < 0 || isWeightLimitExceeded()) return p; return p.setEndNode(endNode).extract(); }
@Override public Path extractPath() { PathNative p = new PathNative(graph, flagEncoder, parents, edgeIds); if (endNode >= 0) p.setWeight(weights[endNode]); p.setFromNode(fromNode); // return 'not found' if invalid endNode or limit reached if (endNode < 0 || isWeightLimitExceeded()) return p; return p.setEndNode(endNode).extract(); }
if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;
if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;
if (heap.isEmpty() || isMaxVisitedNodesExceeded() || isWeightLimitExceeded()) return NOT_FOUND;