See: Description
Interface | Description |
---|---|
ILcdEditableShortestRouteDistanceTableProvider<N,E> |
Editable extension of the
ILcdShortestRouteDistanceTableProvider interface. |
ILcdShortestRouteAlgorithm |
ILcdShortestRouteAlgorithm is an interface for algorithms that find the shortest
routes from a source node to a destination node. |
ILcdShortestRouteDistanceTable<N> |
A table containing the shortest route distance between any pair two
given nodes within a set of nodes.
|
ILcdShortestRouteDistanceTableProvider<N,E> |
A
ILcdShortestRouteDistanceTableProvider provides graph distance tables to algorithms that make use of them. |
ILcdTracingAlgorithm |
ILcdTracingAlgorithm is an interface for algorithms that find the trace that starts
from or leads to a given edge or node. |
ILcdTracingResultHandler<N,E> |
ILcdTracingResultHandler defines a handler interface which is called from within the
tracing algorithm, once for each node for which a trace is found. |
Class | Description |
---|---|
TLcdCrossCountryShortestRouteAlgorithm |
Implementation of a shortest route algorithm, optimized for cross country movement problems.
|
TLcdPartitionedShortestRouteAlgorithm |
Implementation of
ILcdShortestRouteAlgorithm , working with
partitioned graphs. |
TLcdPartitionedShortestRoutePreprocessor |
Preprocesses partitioned graphs for the partitioned shortest route algorithm.
|
TLcdShortestRouteAlgorithm |
Implementation of a shortest route algorithm.
|
TLcdShortestRouteDistanceTable<N> |
Default implementation of
ILcdShortestRouteDistanceTable . |
TLcdShortestRouteDistanceTableProvider<N,E> |
Implementation of
ILcdShortestRouteDistanceTableProvider . |
TLcdTracingAlgorithm |
Implementation of a tracing algorithm, based on the Dijkstra algorithm but
adapted to work with complex edge value functions.
|
This package is part of the the Graph & Routing Engine component.