com.graphhopper.routing.ch.NodeBasedCHBidirPathExtractor Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of graphhopper-core Show documentation
Show all versions of graphhopper-core Show documentation
GraphHopper is a fast and memory efficient Java road routing engine
working seamlessly with OpenStreetMap data.
/*
* Licensed to GraphHopper GmbH under one or more contributor
* license agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* GraphHopper GmbH licenses this file to you under the Apache License,
* Version 2.0 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.graphhopper.routing.ch;
import com.graphhopper.routing.DefaultBidirPathExtractor;
import com.graphhopper.storage.RoutingCHGraph;
public class NodeBasedCHBidirPathExtractor extends DefaultBidirPathExtractor {
private final ShortcutUnpacker shortcutUnpacker;
private final RoutingCHGraph routingGraph;
public NodeBasedCHBidirPathExtractor(RoutingCHGraph routingGraph) {
super(routingGraph.getBaseGraph(), routingGraph.getWeighting());
this.routingGraph = routingGraph;
shortcutUnpacker = createShortcutUnpacker();
}
@Override
public void onEdge(int edge, int adjNode, boolean reverse, int prevOrNextEdge) {
if (reverse) {
shortcutUnpacker.visitOriginalEdgesBwd(edge, adjNode, true, prevOrNextEdge);
} else {
shortcutUnpacker.visitOriginalEdgesFwd(edge, adjNode, true, prevOrNextEdge);
}
}
private ShortcutUnpacker createShortcutUnpacker() {
return new ShortcutUnpacker(routingGraph, (edge, reverse, prevOrNextEdgeId) -> {
path.addDistance(edge.getDistance());
path.addTime(routingGraph.getWeighting().calcEdgeMillis(edge, reverse));
path.addEdge(edge.getEdge());
}, false);
}
}