How to use

PreProcessDijkstra

in

org.matsim.core.router.util

public TransitRouterVariableImpl(final TransitRouterConfig config, final TransitRouterNetworkTravelTimeAndDisutility ttCalculator, final TransitRouterNetworkWW routerNetwork) {
  this.config = config;
  this.transitNetwork = routerNetwork;
  this.ttCalculator = ttCalculator;
  this.dijkstra = new MultiNodeDijkstra(this.transitNetwork, this.ttCalculator, this.ttCalculator);
  PreProcessDijkstra preProcessDijkstra = new PreProcessDijkstra();
  preProcessDijkstra.run(routerNetwork);
  mDijkstra = new MultiDestinationDijkstra(routerNetwork, this.ttCalculator, this.ttCalculator, preProcessDijkstra);
}

public BackwardDijkstraMultipleDestinations(final Network network, final TravelDisutility costFunction, final TravelTime timeFunction,
    final PreProcessDijkstra preProcessData) {
  
  super(network, costFunction, timeFunction, preProcessData);
  this.network = network;
  this.costFunction = costFunction;
  this.timeFunction = timeFunction;
  if (preProcessData != null) {
    if (preProcessData.containsData() == false) {
      this.pruneDeadEnds = false;
      log.warn("The preprocessing data provided to router class Dijkstra contains no data! Please execute its run(...) method first!");
      log.warn("Running without dead-end pruning.");
    } else {
      this.pruneDeadEnds = true;
    }
  } else {
    this.pruneDeadEnds = false;
  }
}

protected PreProcessDijkstra.DeadEndData getPreProcessData(final Node n) {
  return this.preProcessData.getNodeData(n);
}

  @Override
  public LeastCostPathCalculator createPathCalculator(final Network network, final TravelDisutility travelCosts, final TravelTime travelTimes) {
    
    RoutingNetwork routingNetwork = this.routingNetworks.get(network);
    PreProcessDijkstra preProcessDijkstra = this.preProcessData.get(network);
  
    if (routingNetwork == null) {
      routingNetwork = this.routingNetworkFactory.createRoutingNetwork(network);
      
      if (this.usePreProcessData) {
        if (preProcessDijkstra == null) {
          preProcessDijkstra = new PreProcessDijkstra();
          preProcessDijkstra.run(network);
          this.preProcessData.put(network, preProcessDijkstra);
        }
        if (preProcessDijkstra.containsData()) {
          for (RoutingNetworkNode node : routingNetwork.getNodes().values()) {
            node.setDeadEndData(preProcessDijkstra.getNodeData(node.getNode()));
          }
        }
      }
      
      this.routingNetworks.put(network, routingNetwork);
    }
    FastRouterDelegateFactory fastRouterFactory = new ArrayFastRouterDelegateFactory();
    
    return new BackwardFastMultiNodeDijkstra(routingNetwork, travelCosts, travelTimes, 
        preProcessDijkstra, fastRouterFactory, this.searchAllEndNodes);
  }
}

  @Override
  public synchronized LeastCostPathCalculator createPathCalculator(final Network network, final TravelDisutility travelCosts, final TravelTime travelTimes) {
    
    RoutingNetwork routingNetwork = this.routingNetworks.get(network);
    PreProcessDijkstra preProcessDijkstra = this.preProcessData.get(network);

    if (routingNetwork == null) {
      routingNetwork = this.routingNetworkFactory.createRoutingNetwork(network);
      
      if (this.usePreProcessData) {
        if (preProcessDijkstra == null) {
          preProcessDijkstra = new PreProcessDijkstra();
          preProcessDijkstra.run(network);
          this.preProcessData.put(network, preProcessDijkstra);

          for (RoutingNetworkNode node : routingNetwork.getNodes().values()) {
            node.setDeadEndData(preProcessDijkstra.getNodeData(node.getNode()));
          }
        }
      }
      
      this.routingNetworks.put(network, routingNetwork);
    }
    FastRouterDelegateFactory fastRouterFactory = new ArrayFastRouterDelegateFactory();
    
    return new FastMultiNodeDijkstra(routingNetwork, travelCosts, travelTimes, preProcessDijkstra, fastRouterFactory, this.searchAllEndNodes);
  }
}

deadEndData = getNodeData(node);
Map<Id<Node>, Node> incidentNodes = getIncidentNodes(node);
if (incidentNodes.size() == 1) {
  ArrayList<Node> deadEndNodes = new ArrayList<Node>();
    while (deadEndData.getDeadEndEntryNode() != null && it.hasNext()) {
      node = it.next();
      deadEndData = getNodeData(node);
      incidentNodes = getIncidentNodes(node);
    } else {
      log.error("All " + incidentNodes.size() + " incident nodes of node " + node.getId() + " are dead ends!");
deadEndData = getNodeData(node);
for (Node n : deadEndData.getDeadEndNodes()) {
  DeadEndData r = getNodeData(n);
  r.setDeadEndEntryNode(node);
  deadEndNodeCount++;

@Override
public void run(final Network network) {
  super.run(network);
  if (!checkLinkLengths(network)) {
    log.warn("There are links with stored length smaller than their Euclidean distance in this network. Thus, A* cannot guarantee to calculate the least-cost paths between two nodes.");
  }
  updateMinTravelCostPerLength(network);
}

public void run(final Network network) {
  markDeadEnds(network);
  this.containsData = true;
}

  @Override
  public synchronized LeastCostPathCalculator createPathCalculator(final Network network, final TravelDisutility travelCosts, final TravelTime travelTimes) {
    RoutingNetwork routingNetwork = this.routingNetworks.get(network);
    PreProcessDijkstra preProcessDijkstra = this.preProcessData.get(network);

    if (routingNetwork == null) {
      routingNetwork = this.routingNetworkFactory.createRoutingNetwork(network);
      
      if (this.usePreProcessData) {
        if (preProcessDijkstra == null) {
          preProcessDijkstra = new PreProcessDijkstra();
          preProcessDijkstra.run(network);
          this.preProcessData.put(network, preProcessDijkstra);
          
          for (RoutingNetworkNode node : routingNetwork.getNodes().values()) {
            node.setDeadEndData(preProcessDijkstra.getNodeData(node.getNode()));
          }
        }
      }
      
      this.routingNetworks.put(network, routingNetwork);
    }
    FastRouterDelegateFactory fastRouterFactory = new ArrayFastRouterDelegateFactory();
    
    return new FastDijkstra(routingNetwork, travelCosts, travelTimes, preProcessDijkstra, fastRouterFactory);
  }
}

  @Override
  public synchronized LeastCostPathCalculator createPathCalculator(final Network network, final TravelDisutility travelCosts, final TravelTime travelTimes) {
    if (this.usePreProcessData) {
      PreProcessDijkstra preProcessDijkstra = this.preProcessData.get(network);
      if (preProcessDijkstra == null) {
        preProcessDijkstra = new PreProcessDijkstra();
        preProcessDijkstra.run(network);
        this.preProcessData.put(network, preProcessDijkstra);
      }
      return new Dijkstra(network, travelCosts, travelTimes, preProcessDijkstra);
    }
    return new Dijkstra(network, travelCosts, travelTimes);
  }
}

if (preProcessData.containsData() == false) {
  this.pruneDeadEnds = false;
  log.warn("The preprocessing data provided to router class Dijkstra contains no data! Please execute its run(...) method first!");

protected PreProcessDijkstra.DeadEndData getPreProcessData(final Node n) {
  return this.preProcessData.getNodeData(n);
}

  @Override
  public synchronized LeastCostPathCalculator createPathCalculator(final Network network, final TravelDisutility travelCosts, final TravelTime travelTimes) {		
    if (this.usePreProcessData) {
      PreProcessDijkstra preProcessDijkstra = this.preProcessData.get(network);
      if (preProcessDijkstra == null) {
        preProcessDijkstra = new PreProcessDijkstra();
        preProcessDijkstra.run(network);
        this.preProcessData.put(network, preProcessDijkstra);
      }
      return new MultiNodeDijkstra(network, travelCosts, travelTimes, preProcessDijkstra, this.searchAllEndNodes);
    }
    
    return new MultiNodeDijkstra(network, travelCosts, travelTimes, this.searchAllEndNodes);
  }
}

if (!preProcessData.containsData()) {
  this.pruneDeadEnds = false;
  log.warn("The preprocessing data provided to router class Dijkstra contains no data! Please execute its run(...) method first!");