TDCoreDijkstra.java
- /* This file is part of Openrouteservice.
- *
- * Openrouteservice is free software; you can redistribute it and/or modify it under the terms of the
- * GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1
- * of the License, or (at your option) any later version.
- * This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
- * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
- * See the GNU Lesser General Public License for more details.
- * You should have received a copy of the GNU Lesser General Public License along with this library;
- * if not, see <https://www.gnu.org/licenses/>.
- */
- package org.heigit.ors.routing.graphhopper.extensions.core;
- import com.graphhopper.routing.Path;
- import com.graphhopper.routing.SPTEntry;
- import com.graphhopper.routing.weighting.Weighting;
- import com.graphhopper.storage.RoutingCHEdgeIteratorState;
- import com.graphhopper.storage.RoutingCHGraph;
- import com.graphhopper.util.Parameters;
- public class TDCoreDijkstra extends CoreDijkstra {
- private final boolean reverse;
- public TDCoreDijkstra(RoutingCHGraph graph, Weighting weighting, boolean reverse) {
- super(graph, weighting);
- this.reverse = reverse;
- }
- @Override
- protected Path extractPath() {
- if (finished())
- return TDCorePathExtractor.extractPath(chGraph, weighting, bestFwdEntry, bestBwdEntry, bestWeight);
- return createEmptyPath();
- }
- @Override
- public boolean fillEdgesFromCore() {
- if (reverse)
- return true;
- return super.fillEdgesFromCore();
- }
- @Override
- public boolean fillEdgesToCore() {
- if (!reverse)
- return true;
- return super.fillEdgesToCore();
- }
- @Override
- long calcEdgeTime(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse) {
- return currEdge.time + (reverse ? -1 : 1) * calcTime(iter, reverse, currEdge.time);
- }
- @Override
- public String getName() {
- return Parameters.Algorithms.TD_DIJKSTRA;
- }
- }