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.
|
com.luciad.network.graph.numeric |
Contains classes for working with numeric graphs.
|
com.luciad.network.graph.route |
Contains a class for modeling routes and an additional utility class for basic route analysis.
|
Modifier and Type | Method and Description |
---|---|
<N,E> void |
TLcdTracingAlgorithm.getPredecessors(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aSucceedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdTracingResultHandler<N,E> aResultHandler,
double aDistance) |
<N,E> void |
ILcdTracingAlgorithm.getPredecessors(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aSucceedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdTracingResultHandler<N,E> aResultHandler,
double aDistance)
Calculates all traces in the graph leading to the start node of
aSucceedingroute ,
within a given maximum range. |
<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> void |
TLcdTracingAlgorithm.getSuccessors(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdTracingResultHandler<N,E> aResultHandler,
double aDistance) |
<N,E> void |
ILcdTracingAlgorithm.getSuccessors(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdTracingResultHandler<N,E> aResultHandler,
double aDistance)
Calculates all traces in the graph starting from the end node of
aPrecedingRoute ,
within a given maximum range. |
<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 | Interface and Description |
---|---|
interface |
ILcdComplexEdgeValueFunction<N,E>
An edge value function providing access to the sequences of edges that have a special edge value
(that is, a sequence of edges for which the traversal cost is not equal to the sum of the
edge values of the individual edges).
|
Modifier and Type | Class and Description |
---|---|
class |
ALcdNodeValueFunction<N,E>
ALcdNodeValueFunction is an abstract class which can be used to implement edge functions
that associate values with nodes. |
class |
ALcdSimpleEdgeValueFunction<N,E>
ALcdSimpleEdgeValueFunction is an abstract class which can be used to implement edge functions
that associate values with edges, without taking any other information (like the route preceding this
edge) into account. |
class |
ALcdTurnValueFunction<N,E>
ALcdTurnValueFunction is an abstract class which can be used to implement edge functions
that associate values with turns involving only two edges. |
class |
TLcdCompositeEdgeValueFunction<N,E>
TLcdCompositeEdgeValueFunction provides an implementation of
ILcdEdgeValueFunction which can be used to compose a complex
edge value function out of two or more simple edge value functions. |
Constructor and Description |
---|
TLcdCompositeEdgeValueFunction(ILcdEdgeValueFunction<N,E>[] aEdgeValueFunctions)
Constructs a new
TLcdCompositeEdgeValueFunction with the given
array of ILcdEdgeValueFunction . |
Modifier and Type | Method and Description |
---|---|
ILcdEdgeValueFunction<Long,Long> |
TLcdNumericGraph.getEdgeValueFunction()
Returns the edge value function describing the weights of the edges in this graph.
|
Modifier and Type | Method and Description |
---|---|
<N,E> void |
TLcdNumericGraphEncoder.exportEdgeValueFunction(ILcdGraph<N,E> aGraph,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
String aTopologySourceName,
String aEdgeValuesDestinationName)
Exports the specified edge value function for the specified graph.
|
<N,E> void |
TLcdNumericGraphEncoder.exportGraph(ILcdGraph<N,E> aGraph,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdNumericGraphMappingHandler<N,E> aMappingHandler,
String aTopologyDestinationName,
String aEdgeValuesDestinationName)
Export the specified graph and edge value function to a numeric graph.
|
Modifier and Type | Method and Description |
---|---|
static <N,E> double |
TLcdRouteUtil.computeValue(ILcdRoute<N,E> aRoute,
ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction)
Returns the total value of the given route, which is calculated by calculating the values of each edge in the route
with the given
ILcdEdgeValueFunction and adding them. |