PartitioningAlgorithm (JGraphT : a free Java graph library)

Type Parameters:

V - vertex the graph vertex type

All Known Implementing Classes:

BipartitePartitioning
```
public interface PartitioningAlgorithm<V>
```
Algorithm to compute a vertex partitioning of a graph.

Author:

Alexandru Valeanu

Nested Class Summary

Nested Classes
Modifier and Type	Interface	Description
`static interface`	`PartitioningAlgorithm.Partitioning<V>`	A graph partitioning.
`static class`	`PartitioningAlgorithm.PartitioningImpl<V>`	Default implementation of a vertex partition

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`PartitioningAlgorithm.Partitioning<V>`	`getPartitioning()`	Computes a vertex partitioning.
`boolean`	`isValidPartitioning(PartitioningAlgorithm.Partitioning<V> partitioning)`	Check if the given vertex partitioning is valid.

- Method Detail
  - getPartitioning
```
PartitioningAlgorithm.Partitioning<V> getPartitioning()
```
    Computes a vertex partitioning.
    
    Returns:
    
    a vertex partitioning
  - isValidPartitioning
```
boolean isValidPartitioning(PartitioningAlgorithm.Partitioning<V> partitioning)
```
    Check if the given vertex partitioning is valid.
    
    Parameters:
    
    partitioning - the input vertex partitioning
    
    Returns:
    
    true if the input partitioning is valid, false otherwise