Uses of Interface
com.luciad.network.function.ILcdDistanceFunction
Package
Description
Contains interfaces and algorithms for routing (shortest route, tracing).
Provides functions associating values with edges, used by the routing algorithms to determine the length of a route.
-
Uses of ILcdDistanceFunction in com.luciad.network.algorithm.routing
Modifier and TypeMethodDescription<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 anILcdRoute
describing the shortest route betweenaPrecedingRoute
andaSucceedingRoute
.<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> TLcdShortestRouteAlgorithm.getShortestRoute
(ILcdGraph<N, E> aGraph, ILcdRoute<N, E> aPrecedingRoute, ILcdRoute<N, E> aSucceedingRoute, ILcdEdgeValueFunction<N, E> aEdgeValueFunction, ILcdDistanceFunction<N, E> aDistanceFunction) <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 resultingILcdShortestRouteDistanceTableProvider
.<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. -
Uses of ILcdDistanceFunction in com.luciad.network.function
Modifier and TypeClassDescriptionclass
ALcdNodeDistanceFunction
is an abstract class which can be used to implement distance functions that take only nodes into account, not edges preceding or succeeding the start- and/or endpoint.