Package com.luciad.network.algorithm.partitioning

Interface ILcdPartitioningAlgorithm

All Known Implementing Classes:
TLcdClusteredPartitioningAlgorithm
public interface ILcdPartitioningAlgorithm
ILcdPartitioningAlgorithm provides a general interface for algorithms that create partitions of graphs.
Since:
5.1

  • Method Summary

    Modifier and Type
    Method
    Description
    <N, E> ILcdPartitionedGraph<N,E>
    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.

  • Method Details

    • partition

      <N, E> ILcdPartitionedGraph<N,E> 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. The partitioning structure depends on the implementation's specific algorithm that is used.
      Parameters:
      aGraph - the graph to be partitioned.
      Returns:
      the partitioned graph that is a partitioned version of the original graph.
      Throws:
      NullPointerException - if aGraph is null.