MaximalCliqueEnumerationAlgorithm (JGraphT : a free Java graph library)

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Superinterfaces:

Iterable<Set<V>>

All Known Implementing Classes:

BronKerboschCliqueFinder, DegeneracyBronKerboschCliqueFinder, PivotBronKerboschCliqueFinder
```
public interface MaximalCliqueEnumerationAlgorithm<V,E>
extends Iterable<Set<V>>
```
A maximal clique enumeration algorithm.

Author:

Dimitrios Michail

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  Iterator<Set<V>> iterator()
  Returns an iterator over all maximal cliques.
  - Methods inherited from interface java.lang.Iterable
    forEach, spliterator

- Method Detail
  - iterator
```
Iterator<Set<V>> iterator()
```
    Returns an iterator over all maximal cliques.
    
    Specified by:
    
    iterator in interface Iterable<V>
    
    Returns:
    
    an iterator over all maximal cliques