Package | Description |
---|---|
com.luciad.network.algorithm.routing |
Contains interfaces and algorithms for routing (shortest route, tracing).
|
com.luciad.network.function |
Provides functions associating values with edges, used by the routing algorithms to determine the length of a route.
|
Modifier and Type | Method and Description |
---|---|
<N,E> ILcdRoute<N,E> |
TLcdShortestRouteAlgorithm.getShortestRoute(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdDistanceFunction<N,E> aDistanceFunction) |
<N,E> ILcdRoute<N,E> |
TLcdPartitionedShortestRouteAlgorithm.getShortestRoute(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeCostFunction,
ILcdDistanceFunction<N,E> aHeuristicDistanceFunction) |
<N,E> ILcdRoute<N,E> |
ILcdShortestRouteAlgorithm.getShortestRoute(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdDistanceFunction<N,E> aHeuristicDistanceFunction)
Returns an
ILcdRoute describing the shortest route between
aPrecedingRoute and aSucceedingRoute . |
<N,E> ILcdShortestRouteDistanceTableProvider<N,E> |
TLcdPartitionedShortestRoutePreprocessor.preprocess(ILcdPartitionedGraph<N,E> aGraph,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdDistanceFunction<N,E> aHeuristicDistanceFunction)
Preprocesses the given partitioned graph, and returns the resulting
ILcdShortestRouteDistanceTableProvider . |
<N,E> void |
TLcdPartitionedShortestRoutePreprocessor.preprocess(ILcdPartitionedGraph<N,E> aGraph,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdDistanceFunction<N,E> aHeuristicDistanceFunction,
ILcdEditableShortestRouteDistanceTableProvider<N,E> aDistanceTableProviderSFCT)
Preprocesses the given partitioned graph.
|
Modifier and Type | Class and Description |
---|---|
class |
ALcdNodeDistanceFunction<N,E>
ALcdNodeDistanceFunction is an abstract class which can be used to implement
distance functions that take only nodes into account, not edges preceding or succeeding the
start- and/or endpoint. |