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.route |
Contains a class for modeling routes and an additional utility class for basic route analysis.
|
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 . |
ILcdRoute<ILcdPoint,ILcdPolyline> |
TLcdCrossCountryShortestRouteAlgorithm.getShortestRoute(ILcdPoint aStartPoint,
ILcdPoint aEndPoint,
ILcdCrossCountryDistanceFunction aDistanceFunction,
ILcdCrossCountryDistanceFunction aHeuristicDistanceFunction,
double aMaxSearchDistance)
Returns an
ILcdRoute describing the shortest route between the start and end
point. |
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> |
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> |
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> 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. |
void |
ILcdTracingResultHandler.handleNode(N aNode,
ILcdRoute<N,E> aShortestRoute,
double aDistance)
The handler which is invoked for every node for which is trace is found.
|
Modifier and Type | Method and Description |
---|---|
List<ILcdRoute<N,E>> |
ILcdComplexEdgeValueFunction.getComplexEdgeSequences(ILcdGraph<N,E> aGraph,
E aEdge)
Returns the list with all routes for which the cost of adding the specified edge
is different from the edge value of that edge itself.
|
Modifier and Type | Method and Description |
---|---|
double |
ILcdDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
TLcdTraversalDirection aTraversalDirection)
Returns the distance between the end node of
aPrecedingRoute and the start node of
aSucceedingRoute . |
double |
ILcdDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
TLcdTraversalDirection aTraversalDirection)
Returns the distance between the end node of
aPrecedingRoute and the start node of
aSucceedingRoute . |
double |
ALcdNodeDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
TLcdTraversalDirection aTraversalDirection) |
double |
ALcdNodeDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
ILcdRoute<N,E> aSucceedingRoute,
TLcdTraversalDirection aTraversalDirection) |
double |
TLcdCompositeEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
E aEdge,
TLcdTraversalDirection aTraversalDirection)
Returns the value associated with the given edge.
|
double |
ILcdEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aPrecedingRoute,
E aEdge,
TLcdTraversalDirection aTraversalDirection)
Returns the value associated with
aEdge . |
double |
ALcdTurnValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aRoute,
E aNextEdge,
TLcdTraversalDirection aTraversalDirection) |
double |
ALcdSimpleEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aRoute,
E aNextEdge,
TLcdTraversalDirection aTraversalDirection) |
double |
ALcdNodeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph,
ILcdRoute<N,E> aRoute,
E aNextEdge,
TLcdTraversalDirection aTraversalDirection) |
Modifier and Type | Class and Description |
---|---|
class |
TLcdRoute<N,E>
Default implementation of
ILcdRoute . |
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. |
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. |
static <N,E> boolean |
TLcdRouteUtil.isFullyContainedInGraph(ILcdRoute<N,E> aRoute,
ILcdGraph<N,E> aGraph)
Returns true if the given route is fully contained in the given graph, false otherwise.
|
static <N,E> boolean |
TLcdRouteUtil.isPartlyContainedInGraph(ILcdRoute<N,E> aRoute,
ILcdGraph<N,E> aGraph)
Returns true if the given route is partly contained in the given graph, false otherwise.
|