public interface RoutingCHEdgeIteratorState
| 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_EDGEif this is edge state is a shortcut | 
| int | getOrigEdgeFirst()For shortcuts of an edge-based CH graph this is the ID of the first original edge of this edge state, otherwise
 it is the same as  getOrigEdge()} | 
| int | getOrigEdgeLast()For shortcuts of an edge-based CH graph this is the ID of the last original edge of this edge state, otherwise
 it is the same as  getOrigEdge()} | 
| 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() | 
int getEdge()
getOrigEdge()int getOrigEdge()
EdgeIterator.NO_EDGE
 if this is edge state is a shortcutint getOrigEdgeFirst()
getOrigEdge()}int getOrigEdgeLast()
getOrigEdge()}int getBaseNode()
int getAdjNode()
boolean isShortcut()
int getSkippedEdge1()
int getSkippedEdge2()
double getWeight(boolean reverse)
Copyright © 2012–2020. All rights reserved.