boolean isContracted(int node) { return prepareGraph.getLevel(node) != maxLevel; }
@Override public final boolean accept(EdgeIteratorState iter) { // ignore if it is skipNode or adjNode is already contracted int node = iter.getAdjNode(); return avoidNode != node && graph.getLevel(node) == maxLevel; } }
@Override public boolean accept(EdgeIteratorState edgeIterState) { int base = edgeIterState.getBaseNode(); int adj = edgeIterState.getAdjNode(); // always accept virtual edges, see #288 if (base >= maxNodes || adj >= maxNodes) return true; // minor performance improvement: shortcuts in wrong direction are disconnected, so no need to exclude them if (((CHEdgeIteratorState) edgeIterState).isShortcut()) return true; return graph.getLevel(base) <= graph.getLevel(adj); } }
boolean isContracted(int node) { return prepareGraph.getLevel(node) != maxLevel; }
@Override public final boolean accept( EdgeIteratorState iter ) { // ignore if it is skipNode or adjNode is already contracted int node = iter.getAdjNode(); return avoidNode != node && graph.getLevel(node) == maxLevel; } }
@Override public final boolean accept(EdgeIteratorState iter) { // ignore if it is skipNode or adjNode is already contracted int node = iter.getAdjNode(); return avoidNode != node && graph.getLevel(node) == maxLevel; } }
@Override public final boolean accept(EdgeIteratorState iter) { // ignore if it is skipNode or adjNode is already contracted int node = iter.getAdjNode(); return avoidNode != node && graph.getLevel(node) == maxLevel; } }
@Override public boolean accept(EdgeIteratorState edgeIterState) { int base = edgeIterState.getBaseNode(); int adj = edgeIterState.getAdjNode(); // always accept virtual edges, see #288 if (base >= maxNodes || adj >= maxNodes) return true; // minor performance improvement: shortcuts in wrong direction are disconnected, so no need to exclude them if (((CHEdgeIteratorState) edgeIterState).isShortcut()) return true; return graph.getLevel(base) <= graph.getLevel(adj); } }
@Override public boolean accept( EdgeIteratorState edgeIterState ) { int base = edgeIterState.getBaseNode(); int adj = edgeIterState.getAdjNode(); // always accept virtual edges, see #288 if (base >= maxNodes || adj >= maxNodes) return true; // minor performance improvement: shortcuts in wrong direction are disconnected, so no need to exclude them if (((CHEdgeIteratorState) edgeIterState).isShortcut()) return true; return graph.getLevel(base) <= graph.getLevel(adj); } }
@Override public boolean accept(EdgeIteratorState edgeIterState) { int base = edgeIterState.getBaseNode(); int adj = edgeIterState.getAdjNode(); // always accept virtual edges, see #288 if (base >= maxNodes || adj >= maxNodes) return true; // minor performance improvement: shortcuts in wrong direction are disconnected, so no need to exclude them if (((CHEdgeIteratorState) edgeIterState).isShortcut()) return true; return graph.getLevel(base) <= graph.getLevel(adj); } }