Class DijkstraBidirectionCHNoSOD

All Implemented Interfaces:
EdgeToEdgeRoutingAlgorithm, RoutingAlgorithm
Direct Known Subclasses:
AlternativeRouteCH, DijkstraBidirectionCH

public class DijkstraBidirectionCHNoSOD extends AbstractBidirCHAlgo
  • Constructor Details

    • DijkstraBidirectionCHNoSOD

      public DijkstraBidirectionCHNoSOD(RoutingCHGraph graph)
  • Method Details

    • createStartEntry

      protected SPTEntry createStartEntry(int node, double weight, boolean reverse)
      Description copied from class: AbstractBidirAlgo
      Creates the root shortest path tree entry for the forward or backward search.
      Specified by:
      createStartEntry in class AbstractBidirAlgo
    • createEntry

      protected SPTEntry createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)
      Description copied from class: AbstractBidirCHAlgo
      Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.
      Specified by:
      createEntry in class AbstractBidirCHAlgo
      Parameters:
      edge - the id of the edge that is currently processed for the expansion
      adjNode - the adjacent node of the edge
      incEdge - the id of the edge that is incoming to the node the edge is pointed at. usually this is the same as edge, but for edge-based CH and in case edge corresponds to a shortcut incEdge is the original edge that is incoming to the node
      weight - the weight the shortest path three entry should carry
      parent - the parent entry of in the shortest path tree
      reverse - true if we are currently looking at the backward search, false otherwise
    • getParent

      protected SPTEntry getParent(SPTEntry entry)
    • getName

      public String getName()
      Specified by:
      getName in interface RoutingAlgorithm
      Overrides:
      getName in class AbstractBidirAlgo
      Returns:
      name of this algorithm