public class TLcdPartitionedShortestRoutePreprocessor extends Object
ILcdShortestRouteDistanceTableProvider
,
containing a set of TLcdShortestRouteDistanceTable
(one for each partition).
Note that the preprocessing result is specific for the given
ILcdPartitionedGraph
and given ILcdEdgeValueFunction
.
Modifying the partitioning scheme or one or more of the edges/nodes contained
in it, or modifying the edge value function requires a new preprocessing
step. Otherwise, optimal routing results are not guaranteed anymore.Constructor and Description |
---|
TLcdPartitionedShortestRoutePreprocessor()
Constructs a new
TLcdPartitionedShortestRoutePreprocessor . |
Modifier and Type | Method and Description |
---|---|
<N,E> ILcdShortestRouteDistanceTableProvider<N,E> |
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 |
preprocess(ILcdPartitionedGraph<N,E> aGraph,
ILcdEdgeValueFunction<N,E> aEdgeValueFunction,
ILcdDistanceFunction<N,E> aHeuristicDistanceFunction,
ILcdEditableShortestRouteDistanceTableProvider<N,E> aDistanceTableProviderSFCT)
Preprocesses the given partitioned graph.
|
public TLcdPartitionedShortestRoutePreprocessor()
TLcdPartitionedShortestRoutePreprocessor
.public <N,E> void preprocess(ILcdPartitionedGraph<N,E> aGraph, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdDistanceFunction<N,E> aHeuristicDistanceFunction, ILcdEditableShortestRouteDistanceTableProvider<N,E> aDistanceTableProviderSFCT)
aGraph
- the graph to be preprocessed.aEdgeValueFunction
- the edge value function that will be used
in the routing algorithm.aHeuristicDistanceFunction
- a heuristic distance function - not required.aDistanceTableProviderSFCT
- the distance table provider in which the computed distance tables
should be stored.NullPointerException
- if the given graph or edge value function is null
.public <N,E> ILcdShortestRouteDistanceTableProvider<N,E> preprocess(ILcdPartitionedGraph<N,E> aGraph, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdDistanceFunction<N,E> aHeuristicDistanceFunction)
ILcdShortestRouteDistanceTableProvider
.aGraph
- the graph to be preprocessed.aEdgeValueFunction
- the edge value function that will be used
in the routing algorithm.aHeuristicDistanceFunction
- a heuristic distance function - not required.NullPointerException
- if the given graph or edge value function is null
.