Interface | Description |
---|---|
SPTWalker.SPTVisitor |
Class | Description |
---|---|
DominanceFunction |
A class that determines when one search branch prunes another at the same Vertex, and ultimately which solutions
are retained.
|
DominanceFunction.EarliestArrival |
This approach is more coherent in Analyst when we are extracting travel times from the optimal
paths.
|
DominanceFunction.LeastWalk |
A dominance function that prefers the least walking.
|
DominanceFunction.MinimumWeight | |
DominanceFunction.Pareto |
In this implementation the relation is not symmetric.
|
GraphPath |
A shortest path on the graph.
|
ShortestPathTree |
This class keeps track which graph vertices have been visited and their associated states,
so that decisions can be made about whether new states should be enqueued for later exploration.
|
SPTWalker |
Walk over a SPT tree to geometrically visit all nodes and edge geometry.
|
Copyright © 2018. All rights reserved.