Package com.luciad.network.algorithm.routing
package com.luciad.network.algorithm.routing
Contains interfaces and algorithms for routing (shortest route, tracing).
Classes for routing preprocessing are also provided.
This package is part of the the Graph & Routing Engine component.
 Since:
 5.1

ClassDescriptionEditable extension of the
ILcdShortestRouteDistanceTableProvider
interface.ILcdShortestRouteAlgorithm
is an interface for algorithms that find the shortest routes from a source node to a destination node.A table containing the shortest route distance between any pair two given nodes within a set of nodes.AILcdShortestRouteDistanceTableProvider
provides graph distance tables to algorithms that make use of them.ILcdTracingAlgorithm
is an interface for algorithms that find the trace that starts from or leads to a given edge or node.ILcdTracingResultHandler
defines a handler interface which is called from within the tracing algorithm, once for each node for which a trace is found.Implementation of a shortest route algorithm, optimized for cross country movement problems.Implementation ofILcdShortestRouteAlgorithm
, working with partitioned graphs.Preprocesses partitioned graphs for the partitioned shortest route algorithm.Implementation of a shortest route algorithm.Default implementation ofILcdShortestRouteDistanceTable
.Implementation ofILcdShortestRouteDistanceTableProvider
.Implementation of a tracing algorithm, based on the Dijkstra algorithm but adapted to work with complex edge value functions.