| Package | Description |
|---|---|
| com.luciad.network.algorithm.routing |
Contains interfaces and algorithms for routing (shortest route, tracing).
|
| 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> 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. |