@Override public CHEdgeExplorer createEdgeExplorer() { return createEdgeExplorer(EdgeFilter.ALL_EDGES); }
CHGraphImpl lg = (CHGraphImpl) getGraph(graph); EdgeExplorer chCarOutExplorer = lg.createEdgeExplorer(carOutFilter); EdgeExplorer tmpCarInExplorer = lg.createEdgeExplorer(carInFilter); tmp.setSkippedEdges(14, 15); EdgeIterator iter = lg.createEdgeExplorer().setBaseNode(1); iter.next(); assertEquals(3, iter.getAdjNode()); assertEquals(1, GHUtility.count(chCarOutExplorer.setBaseNode(3))); lg.disconnect(lg.createEdgeExplorer(), iter); assertEquals(0, GHUtility.count(chCarOutExplorer.setBaseNode(3))); assertEquals(0, iter.getAdjNode()); assertEquals(1, GHUtility.count(tmpCarInExplorer.setBaseNode(0))); lg.disconnect(lg.createEdgeExplorer(), iter); assertEquals(0, GHUtility.count(tmpCarInExplorer.setBaseNode(0))); assertEquals(2, iter.getAdjNode()); assertEquals(1, GHUtility.count(chCarOutExplorer.setBaseNode(2))); lg.disconnect(lg.createEdgeExplorer(), iter); assertEquals(0, GHUtility.count(chCarOutExplorer.setBaseNode(2)));
lg.setLevel(1, 10); lg.disconnect(lg.createEdgeExplorer(), iter1); lg.disconnect(lg.createEdgeExplorer(), iter1);
@Override public CHEdgeExplorer createEdgeExplorer() { return createEdgeExplorer(EdgeFilter.ALL_EDGES); }
@Override public CHEdgeExplorer createEdgeExplorer() { return createEdgeExplorer(EdgeFilter.ALL_EDGES); }
@Override public CHEdgeExplorer createEdgeExplorer() { return createEdgeExplorer(EdgeFilter.ALL_EDGES); }
vehicleInExplorer = prepareGraph.createEdgeExplorer(new DefaultEdgeFilter(prepareFlagEncoder, true, false)); vehicleOutExplorer = prepareGraph.createEdgeExplorer(new DefaultEdgeFilter(prepareFlagEncoder, false, true)); final EdgeFilter allFilter = new DefaultEdgeFilter(prepareFlagEncoder, true, true); vehicleAllExplorer = prepareGraph.createEdgeExplorer(allFilter); vehicleAllTmpExplorer = prepareGraph.createEdgeExplorer(allFilter); calcPrioAllExplorer = prepareGraph.createEdgeExplorer(accessWithLevelFilter);
maxEdgesCount = ghStorage.getAllEdges().getMaxId(); FlagEncoder prepareFlagEncoder = prepareWeighting.getFlagEncoder(); vehicleInExplorer = prepareGraph.createEdgeExplorer(new DefaultEdgeFilter(prepareFlagEncoder, true, false)); vehicleOutExplorer = prepareGraph.createEdgeExplorer(new DefaultEdgeFilter(prepareFlagEncoder, false, true)); final EdgeFilter allFilter = new DefaultEdgeFilter(prepareFlagEncoder, true, true); vehicleAllExplorer = prepareGraph.createEdgeExplorer(allFilter); vehicleAllTmpExplorer = prepareGraph.createEdgeExplorer(allFilter); calcPrioAllExplorer = prepareGraph.createEdgeExplorer(accessWithLevelFilter);
private void initFromGraph() { ghStorage.freeze(); FlagEncoder prepareFlagEncoder = prepareWeighting.getFlagEncoder(); final EdgeFilter allFilter = DefaultEdgeFilter.allEdges(prepareFlagEncoder); maxLevel = prepareGraph.getNodes(); vehicleAllExplorer = prepareGraph.createEdgeExplorer(allFilter); vehicleAllTmpExplorer = prepareGraph.createEdgeExplorer(allFilter); // Use an alternative to PriorityQueue as it has some advantages: // 1. Gets automatically smaller if less entries are stored => less total RAM used. // Important because Graph is increasing until the end. // 2. is slightly faster // but we need the additional oldPriorities array to keep the old value which is necessary for the update method sortedNodes = new GHTreeMapComposed(); oldPriorities = new float[prepareGraph.getNodes()]; nodeContractor = new NodeBasedNodeContractor(dir, ghStorage, prepareGraph, weighting, pMap); nodeContractor.initFromGraph(); }