public interface ILcdPartitioningAlgorithm
ILcdPartitioningAlgorithm provides a general interface for algorithms that create partitions of
graphs.| Modifier and Type | Method and 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. |
<N,E> ILcdPartitionedGraph<N,E> partition(ILcdGraph<N,E> aGraph)
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.aGraph - the graph to be partitioned.NullPointerException - if aGraph is null.