Uses of Interface
com.luciad.network.graph.ILcdGraph

Packages that use ILcdGraph

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.function	Provides functions associating values with edges, used by the routing algorithms to determine the length of a route.
com.luciad.network.graph	Contains interfaces and classes for modeling basic graphs.
com.luciad.network.graph.numeric	Contains classes for working with numeric graphs.
com.luciad.network.graph.partition	Contains classes for modeling partitioned graphs.
com.luciad.network.graph.route	Contains a class for modeling routes and an additional utility class for basic route analysis.

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

Methods in com.luciad.network.algorithm.partitioning with parameters of type ILcdGraph

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 ILcdGraph in com.luciad.network.algorithm.routing

Methods in com.luciad.network.algorithm.routing that return ILcdGraph

Modifier and Type	Method	Description
ILcdGraph<N,E>	ILcdShortestRouteDistanceTableProvider.getGraph(ILcdShortestRouteDistanceTable<N> aDistanceTable)	Returns the graph that is associated with the given distance table.
ILcdGraph<N,E>	TLcdShortestRouteDistanceTableProvider.getGraph(ILcdShortestRouteDistanceTable<N> aDistanceTable)

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

Modifier and Type	Method	Description
ILcdShortestRouteDistanceTable<N>	ILcdShortestRouteDistanceTableProvider.getDistanceTable(ILcdGraph<N,E> aGraph)	Returns the distance table that is associated with the given graph.
ILcdShortestRouteDistanceTable<N>	TLcdShortestRouteDistanceTableProvider.getDistanceTable(ILcdGraph<N,E> aGraph)
<N, E> void	ILcdTracingAlgorithm.getPredecessors(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aSucceedingRoute, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdTracingResultHandler<N,E> aResultHandler, double aDistance)	Calculates all traces in the graph leading to the start node of aSucceedingroute, within a given maximum range.
<N, E> void	TLcdTracingAlgorithm.getPredecessors(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aSucceedingRoute, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdTracingResultHandler<N,E> aResultHandler, double aDistance)
<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 an ILcdRoute describing the shortest route between aPrecedingRoute and aSucceedingRoute.
<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> void	ILcdTracingAlgorithm.getSuccessors(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdTracingResultHandler<N,E> aResultHandler, double aDistance)	Calculates all traces in the graph starting from the end node of aPrecedingRoute, within a given maximum range.
<N, E> void	TLcdTracingAlgorithm.getSuccessors(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdTracingResultHandler<N,E> aResultHandler, double aDistance)
void	ILcdEditableShortestRouteDistanceTableProvider.setDistanceTable(ILcdGraph<N,E> aGraph, ILcdShortestRouteDistanceTable<N> aDistanceTable)	Registers the specified distance table for the given graph on this distance table provider.
void	TLcdShortestRouteDistanceTableProvider.setDistanceTable(ILcdGraph<N,E> aGraph, ILcdShortestRouteDistanceTable<N> aDistanceTable)

Uses of ILcdGraph in com.luciad.network.function

Methods in com.luciad.network.function with parameters of type ILcdGraph

Modifier and Type	Method	Description
final double	ALcdNodeDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, ILcdRoute<N,E> aSucceedingRoute, TLcdTraversalDirection aTraversalDirection)
abstract double	ALcdNodeDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph, N aStartNode, N aEndNode, TLcdTraversalDirection aTraversalDirection)	Returns the distance between the two given nodes.
double	ILcdDistanceFunction.computeDistance(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, ILcdRoute<N,E> aSucceedingRoute, TLcdTraversalDirection aTraversalDirection)	Returns the distance between the end node of aPrecedingRoute and the start node of aSucceedingRoute.
final double	ALcdNodeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aRoute, E aNextEdge, TLcdTraversalDirection aTraversalDirection)
final double	ALcdSimpleEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aRoute, E aNextEdge, TLcdTraversalDirection aTraversalDirection)
abstract double	ALcdSimpleEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph, E aEdge, TLcdTraversalDirection aTraversalDirection)	Returns the value associated with the given edge.
final double	ALcdTurnValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aRoute, E aNextEdge, TLcdTraversalDirection aTraversalDirection)
double	ILcdEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, E aEdge, TLcdTraversalDirection aTraversalDirection)	Returns the value associated with aEdge.
double	TLcdCompositeEdgeValueFunction.computeEdgeValue(ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, E aEdge, TLcdTraversalDirection aTraversalDirection)	Returns the value associated with the given edge.
abstract double	ALcdNodeValueFunction.computeNodeValue(ILcdGraph<N,E> aGraph, N aNode)	Returns the value associated with the given node.
abstract double	ALcdTurnValueFunction.computeTurnValue(ILcdGraph<N,E> aGraph, E aEdge, N aNode, E aNextEdge, TLcdTraversalDirection aTraversalDirection)	Returns the value associated with the given turn.
List<ILcdRoute<N,E>>	ILcdComplexEdgeValueFunction.getComplexEdgeSequences(ILcdGraph<N,E> aGraph, E aEdge)	Returns the list with all routes for which the cost of adding the specified edge is different from the edge value of that edge itself.

Uses of ILcdGraph in com.luciad.network.graph

Subinterfaces of ILcdGraph in com.luciad.network.graph

Modifier and Type	Interface	Description
interface	ILcdEditableGraph<N,E>	An ILcdEditableGraph is a graph to which nodes and edges can be added or removed.

Classes in com.luciad.network.graph that implement ILcdGraph

Modifier and Type	Class	Description
class	TLcdGraph<N,E>	Implementation of ILcdGraph.

Methods in com.luciad.network.graph that return ILcdGraph

Modifier and Type	Method	Description
ILcdGraph	TLcdGraphChangedEvent.getGraph()	Returns the ILcdGraph that is the source of this TLcdGraphChangedEvent.

Constructors in com.luciad.network.graph with parameters of type ILcdGraph

Modifier	Constructor	Description
	TLcdGraphChangedEvent(ILcdGraph aGraph, int aCode, Vector<N> aChangedNodes, Vector aIndividualNodeChanges, Vector<E> aChangedEdges, Vector aIndividualEdgeChanges)	Constructs a new TLcdGraphChangedEvent with the given parameters.

Uses of ILcdGraph in com.luciad.network.graph.numeric

Classes in com.luciad.network.graph.numeric that implement ILcdGraph

Modifier and Type	Class	Description
class	TLcdNumericGraph	A graph implementation whose nodes, edges and partitions are all represented by a numerical identifer.

Methods in com.luciad.network.graph.numeric with parameters of type ILcdGraph

Modifier and Type	Method	Description
<N, E> void	TLcdNumericGraphEncoder.exportEdgeValueFunction(ILcdGraph<N,E> aGraph, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, String aTopologySourceName, String aEdgeValuesDestinationName)	Exports the specified edge value function for the specified graph.
<N, E> void	TLcdNumericGraphEncoder.exportGraph(ILcdGraph<N,E> aGraph, ILcdEdgeValueFunction<N,E> aEdgeValueFunction, ILcdNumericGraphMappingHandler<N,E> aMappingHandler, String aTopologyDestinationName, String aEdgeValuesDestinationName)	Export the specified graph and edge value function to a numeric graph.
void	ILcdNumericGraphMappingHandler.mapGraph(ILcdGraph<N,E> aGraph, long aNumericId)	Reports that the specified graph (partition or boundary graph) from the source graph is mapped on the specified long value in the destination numeric graph.

Uses of ILcdGraph in com.luciad.network.graph.partition

Subinterfaces of ILcdGraph 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).
interface	ILcdPartitionedGraph<N,E>	An ILcdPartitionedGraph is an ILcdGraph which is composed of partitions.

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

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 ILcdGraph

Modifier and Type	Method	Description
ILcdGraph<N,E>	ILcdPartitionedGraph.getBoundaryGraph()	Returns the boundary graph of this graph.
ILcdGraph<N,E>	TLcdLimitedEditablePartitionedGraph.getBoundaryGraph()
ILcdGraph<N,E>	ILcdPartitionedGraph.getPartitionForEdge(E aEdge)	Returns the partition of this partitioned graph that contains the given edge, or null if the given edge is not part of a partition in this graph.
ILcdGraph<N,E>	TLcdLimitedEditablePartitionedGraph.getPartitionForEdge(E aEdge)
ILcdGraph<N,E>	ILcdPartitionedGraph.getPartitionForNode(N aNode)	Returns the partition of this partitioned graph that contains the given node, or null if the given node is not part of a partition in this graph.
ILcdGraph<N,E>	TLcdLimitedEditablePartitionedGraph.getPartitionForNode(N aNode)

Methods in com.luciad.network.graph.partition that return types with arguments of type ILcdGraph

Modifier and Type	Method	Description
Enumeration<ILcdGraph<N,E>>	ILcdPartitionedGraph.getPartitions()	Returns an Enumeration containing all partitions of this graph.
Enumeration<ILcdGraph<N,E>>	TLcdLimitedEditablePartitionedGraph.getPartitions()
Enumeration<ILcdGraph<N,E>>	TLcdPartitionedGraphChangedEvent.partitions()	Returns an Enumeration of all the partitions that have been added, removed or changed with respect to the ILcdPartitionedGraph.

Methods in com.luciad.network.graph.partition with parameters of type ILcdGraph

Modifier and Type	Method	Description
void	ILcdLimitedEditablePartitionedGraph.addPartition(ILcdGraph<N,E> aPartition, int aPartitionedGraphFireEventMode, int aGraphFireEventMode)	Adds a partition to this graph.
void	TLcdLimitedEditablePartitionedGraph.addPartition(ILcdGraph<N,E> aPartition, int aPartitionedGraphFireEventMode, int aGraphFireEventMode)
boolean	ILcdLimitedEditablePartitionedGraph.canAddPartition(ILcdGraph<N,E> aPartition)	Returns true if the given partition can be added to this partitioned graph, false otherwise.
boolean	TLcdLimitedEditablePartitionedGraph.canAddPartition(ILcdGraph<N,E> aPartition)	Returns true if the given partition can be added to this partitioned graph, false otherwise.
boolean	TLcdPartitionedGraph.canAddPartition(ILcdGraph<N,E> aPartition)	Returns true if the given partition can be added to this partitioned graph, false otherwise.
boolean	ILcdLimitedEditablePartitionedGraph.canRemoveBoundaryEdges(ILcdGraph<N,E> aPartition)	Returns true if the boundary edge connected to the given partition can be removed from this graph, false otherwise.
boolean	TLcdLimitedEditablePartitionedGraph.canRemoveBoundaryEdges(ILcdGraph<N,E> aPartition)
boolean	ILcdLimitedEditablePartitionedGraph.canRemovePartition(ILcdGraph<N,E> aPartition)	Returns true if the given partition can be removed from this partitioned graph, false otherwise.
boolean	TLcdLimitedEditablePartitionedGraph.canRemovePartition(ILcdGraph<N,E> aPartition)	Returns true if the given partition can be removed from this partitioned graph, false otherwise.
boolean	ILcdPartitionedGraph.containsPartition(ILcdGraph<N,E> aPartition)	Returns true if the given graph is a partition of this graph, false otherwise.
boolean	TLcdLimitedEditablePartitionedGraph.containsPartition(ILcdGraph<N,E> aPartition)
boolean	TLcdPartitionedGraphChangedEvent.containsPartition(ILcdGraph<N,E> aObject)	Returns whether aObject is a partition associated to this TLcdPartitionedGraphChangedEvent.
Enumeration<E>	ILcdPartitionedGraph.getBoundaryEdges(ILcdGraph<N,E> aPartition)	Returns an enumeration containing all boundary edges of the given partition.
Enumeration<E>	TLcdLimitedEditablePartitionedGraph.getBoundaryEdges(ILcdGraph<N,E> aPartition)
Enumeration<N>	ILcdPartitionedGraph.getBoundaryNodes(ILcdGraph<N,E> aPartition)	Returns an enumeration containing all boundary nodes of the given partition.
Enumeration<N>	TLcdLimitedEditablePartitionedGraph.getBoundaryNodes(ILcdGraph<N,E> aPartition)
Enumeration<E>	ILcdLimitedEditablePartitionedGraph.removeBoundaryEdges(ILcdGraph<N,E> aPartition, int aPartitionedGraphFireEventMode, int aGraphFireEventMode)	Removes all boundary edges that are connected to the given partition.
Enumeration<E>	TLcdLimitedEditablePartitionedGraph.removeBoundaryEdges(ILcdGraph<N,E> aPartition, int aPartitionedGraphFireEventMode, int aGraphFireEventMode)
void	ILcdLimitedEditablePartitionedGraph.removePartition(ILcdGraph<N,E> aPartition, int aPartitionedGraphFireEventMode, int aGraphFireEventMode)	Removes the given partition from this graph.
void	TLcdLimitedEditablePartitionedGraph.removePartition(ILcdGraph<N,E> aPartition, int aPartitionedGraphFireEventMode, int aGraphFireEventMode)
TLcdPartitionedGraphChangedEvent.Change	TLcdPartitionedGraphChangedEvent.retrievePartitionChange(ILcdGraph<N,E> aPartition)	Returns the details concerning aObject in this TLcdPartitionedGraphChangedEvent.

Constructor parameters in com.luciad.network.graph.partition with type arguments of type ILcdGraph

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.

Uses of ILcdGraph in com.luciad.network.graph.route

Methods in com.luciad.network.graph.route with parameters of type ILcdGraph

Modifier and Type	Method	Description
static <N, E> double	TLcdRouteUtil.computeValue(ILcdRoute<N,E> aRoute, ILcdGraph<N,E> aGraph, ILcdRoute<N,E> aPrecedingRoute, ILcdEdgeValueFunction<N,E> aEdgeValueFunction)	Returns the total value of the given route, which is calculated by calculating the values of each edge in the route with the given ILcdEdgeValueFunction and adding them.
static <N, E> boolean	TLcdRouteUtil.isFullyContainedInGraph(ILcdRoute<N,E> aRoute, ILcdGraph<N,E> aGraph)	Returns true if the given route is fully contained in the given graph, false otherwise.
static <N, E> boolean	TLcdRouteUtil.isPartlyContainedInGraph(ILcdRoute<N,E> aRoute, ILcdGraph<N,E> aGraph)	Returns true if the given route is partly contained in the given graph, false otherwise.

Constructors in com.luciad.network.graph.route with parameters of type ILcdGraph

Modifier	Constructor	Description
	TLcdRoute(ILcdGraph<N,E> aGraph, N aStartNode)	Create a new route which has all its edges and nodes contained in the given graph, with the given start node.