Uses of Interface
com.luciad.network.graph.partition.ILcdPartitionedGraph

Packages that use ILcdPartitionedGraph

Package	Description
com.luciad.network.algorithm.partitioning	Contains an interface and algorithm for partitioning graphs.
com.luciad.network.algorithm.routing	Contains interfaces and algorithms for routing (shortest route, tracing).
com.luciad.network.graph.partition	Contains classes for modeling partitioned graphs.

Uses of ILcdPartitionedGraph in com.luciad.network.algorithm.partitioning

Methods in com.luciad.network.algorithm.partitioning that return ILcdPartitionedGraph

Modifier and Type	Method	Description
<N, E> ILcdPartitionedGraph<N,E>	ILcdPartitioningAlgorithm.partition(ILcdGraph<N,E> aGraph)	Returns an ILcdPartitionedGraph that consists of a set of ILcdGraph each containing a subset of the group of edges and nodes in the original graph, and together containing the complete original graph.
<N, E> ILcdPartitionedGraph<N,E>	TLcdClusteredPartitioningAlgorithm.partition(ILcdGraph<N,E> aGraph)	Returns a partitioned copy of the given graph.
<N, E> ILcdPartitionedGraph<N,E>	TLcdClusteredPartitioningAlgorithm.partition(ILcdGraph<N,E> aGraph, Vector<E> aConstraintedEdges)	Returns a partitioned copy of the given graph, but keeps each of the constrainted edges within one partition (none of the constrainted edges will become a boundary edge).
<N, E> ILcdPartitionedGraph<N,E>	TLcdClusteredPartitioningAlgorithm.partition(ILcdGraph<N,E> aGraph, Vector<E> aConstraintedEdges, double aAlpha)	Returns a partitioned copy of the given graph, but keeps each of the constrainted edges within one partition (none of the constrainted edges will become a boundary edge).
<N, E> ILcdPartitionedGraph<N,E>	TLcdClusteredPartitioningAlgorithm.partition(ILcdGraph<N,E> aGraph, Vector<E> aConstraintedEdges, int aMaxNrPartitioningLevels, int aNrEdgesThreshold, int aMinPartitions, int aMaxPartitions)	Returns a partitioned copy of the given graph, taking into account the specified constraints.

Uses of ILcdPartitionedGraph in com.luciad.network.algorithm.routing

Methods in com.luciad.network.algorithm.routing with parameters of type ILcdPartitionedGraph

Modifier and Type	Method	Description
<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 resulting ILcdShortestRouteDistanceTableProvider.
<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 ILcdPartitionedGraph in com.luciad.network.graph.partition

Subinterfaces of ILcdPartitionedGraph in com.luciad.network.graph.partition

Modifier and Type	Interface	Description
interface	ILcdLimitedEditablePartitionedGraph<N,E>	An ILcdLimitedEditablePartitionedGraph is a partitioned graph with editable internal boundaries, and to which partitions can be added (or removed).

Classes in com.luciad.network.graph.partition that implement ILcdPartitionedGraph

Modifier and Type	Class	Description
class	TLcdLimitedEditablePartitionedGraph<N,E>	Implementation of ILcdLimitedEditablePartitionedGraph.
class	TLcdPartitionedGraph<N,E>	An implementation of ILcdLimitedEditablePartitionedGraph that is also an ILcdEditableGraph.

Methods in com.luciad.network.graph.partition that return ILcdPartitionedGraph

Modifier and Type	Method	Description
ILcdPartitionedGraph<N,E>	TLcdPartitionedGraphChangedEvent.getGraph()	Returns the ILcdPartitionedGraph that is the source of this TLcdPartitionedGraphChangedEvent.

Constructors in com.luciad.network.graph.partition with parameters of type ILcdPartitionedGraph

Modifier	Constructor	Description
	TLcdPartitionedGraphChangedEvent(ILcdPartitionedGraph aGraph, int aCode, Vector<ILcdGraph<N,E>> aChangedPartitions, Vector aIndividualPartitionChanges, Vector<E> aChangedBoundaryEdges, Vector aIndividualBoundaryEdgeChanges)	Constructs a new TLcdPartitionedGraphChangedEvent with the given parameters.