Package com.graphhopper.routing.ch

Class ShortcutUnpacker

java.lang.Object

com.graphhopper.routing.ch.ShortcutUnpacker

public class ShortcutUnpacker
extends Object

Recursively unpack shortcuts.

Author:

Peter Karich, easbar

See Also:

• PrepareContractionHierarchies

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static interface	ShortcutUnpacker.Visitor

Constructor Summary

Constructors

Constructor	Description
ShortcutUnpacker(RoutingCHGraph graph, ShortcutUnpacker.Visitor visitor, boolean edgeBased)

Method Summary

Modifier and Type	Method	Description
void	visitOriginalEdgesBwd(int edgeId, int adjNode, boolean reverseOrder, int prevOrNextEdgeId)
void	visitOriginalEdgesFwd(int edgeId, int adjNode, boolean reverseOrder, int prevOrNextEdgeId)	Finds an edge/shortcut with the given id and adjNode and calls the visitor for each original edge that is packed inside this shortcut (or if an original edge is given simply calls the visitor on it).

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

ShortcutUnpacker

public ShortcutUnpacker(RoutingCHGraph graph,
 ShortcutUnpacker.Visitor visitor,
 boolean edgeBased)

Method Details

visitOriginalEdgesFwd

public void visitOriginalEdgesFwd(int edgeId,
 int adjNode,
 boolean reverseOrder,
 int prevOrNextEdgeId)

Finds an edge/shortcut with the given id and adjNode and calls the visitor for each original edge that is packed inside this shortcut (or if an original edge is given simply calls the visitor on it).

Parameters:

reverseOrder - if true the original edges will be traversed in reverse order

visitOriginalEdgesBwd

public void visitOriginalEdgesBwd(int edgeId,
 int adjNode,
 boolean reverseOrder,
 int prevOrNextEdgeId)