com.graphhopper.storage

Interface RoutingCHEdgeIteratorState

All Known Subinterfaces:

RoutingCHEdgeIterator

All Known Implementing Classes:

RoutingCHEdgeIteratorImpl, RoutingCHEdgeIteratorStateImpl

public interface RoutingCHEdgeIteratorState

Method Summary

Modifier and Type	Method and Description
int	getAdjNode()
int	getBaseNode()
int	getEdge() The CH edge ID of this edge state.
int	getOrigEdge() The original/base/query graph edge ID of the edge this CH edge state represents or EdgeIterator.NO_EDGE if this is edge state is a shortcut
int	getOrigEdgeKeyFirst() For shortcuts of an edge-based CH graph this is the key of the first original edge of this edge state *in the direction of the shortcut*, i.e.
int	getOrigEdgeKeyLast()
int	getSkippedEdge1() The CH edge ID of the first skipped edge/shortcut of this edge state
int	getSkippedEdge2() The CH edge ID of the second skipped edge/shortcut of this edge state
double	getWeight(boolean reverse)
boolean	isShortcut()

Method Detail

getEdge

int getEdge()

The CH edge ID of this edge state. This is generally not the same as getOrigEdge()

getOrigEdge

int getOrigEdge()

The original/base/query graph edge ID of the edge this CH edge state represents or EdgeIterator.NO_EDGE if this is edge state is a shortcut

getOrigEdgeKeyFirst

int getOrigEdgeKeyFirst()

For shortcuts of an edge-based CH graph this is the key of the first original edge of this edge state *in the direction of the shortcut*, i.e. the one this shortcut starts with. Otherwise it is the key of the original/base/query graph edge this CH edge state represents. It is not so obvious how the direction of this key shall be defined. For base graph edges it is clear as we use the storage direction and the value of the key simply depends on which node is the base node (the one stored first or second). For shortcut edges we use the direction of the shortcut to define the direction of the first/last original edge key.

getOrigEdgeKeyLast

int getOrigEdgeKeyLast()

See Also:

#getOrigEdgeKeyFirst(), but for the last edge, i.e. the one the shortcut points to. For shortcuts of an edge-based CH graph this is the key of the last original edge of this edge state, otherwise it is the key of the original/base/query graph edge this CH edge state represents.

getBaseNode

int getBaseNode()

getAdjNode

int getAdjNode()

isShortcut

boolean isShortcut()

getSkippedEdge1

int getSkippedEdge1()

The CH edge ID of the first skipped edge/shortcut of this edge state

getSkippedEdge2

int getSkippedEdge2()

The CH edge ID of the second skipped edge/shortcut of this edge state

getWeight

double getWeight(boolean reverse)