- <init>
Constructor.
- calcLeastCostPath
Calculates the cheapest route from Node 'fromNode' to Node 'toNode' at starting
time 'startTime'.
- addToPendingNodes
Adds some parameters to the given Node then adds it to the set of pending nodes.
- augmentIterationId
Augments the iterationID and checks whether the visited information in the nodes
in the nodes have t
- canPassLink
- constructPath
Constructs the path after the algorithm has been run.
- createNodeData
- createRouterPriorityQueue
Allow replacing the RouterPriorityQueue.
- getData
Returns the data for the given node. Creates a new NodeData if none exists yet.
- getIterationId
- getPreProcessData
- getPriority
The value used to sort the pending nodes during routing. This implementation
compares the total effe