MaximalIndependentSetsEnumeratorAbstract (JGAlgo - Parent 0.5.1-SNAPSHOT API)

java.lang.Object
- com.jgalgo.alg.clique.MaximalIndependentSetsEnumeratorAbstract

All Implemented Interfaces:

MaximalIndependentSetsEnumerator

Direct Known Subclasses:

MaximalIndependentSetsEnumeratorComplementCliques
```
public abstract class MaximalIndependentSetsEnumeratorAbstract
extends Object
implements MaximalIndependentSetsEnumerator
```
Abstract class for enumerating over all maximal independent sets in a graph.
The class implements the interface by solving the problem on the index graph and then maps the results back to the original graph. The implementation for index graphs is abstract and left to the subclasses.

Author:

Barak Ugav

Constructor Summary

Constructors
Constructor Description

MaximalIndependentSetsEnumeratorAbstract()
Default constructor.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`<V,E> Iterator<Set<V>>`	`maximalIndependentSetsIter(Graph<V,E> g)`	Iterate over all maximal independent sets in a graph.

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - MaximalIndependentSetsEnumeratorAbstract
```
public MaximalIndependentSetsEnumeratorAbstract()
```
    Default constructor.
- Method Detail
  - maximalIndependentSetsIter
```
public <V,E> Iterator<Set<V>> maximalIndependentSetsIter(Graph<V,E> g)
```
    Description copied from interface: MaximalIndependentSetsEnumerator
    
    Iterate over all maximal independent sets in a graph.
    The input graph should not be changed during the iteration.
    If g is IntGraph, the returned iterator will be iterate over IntSet.
    
    Specified by:
    
    maximalIndependentSetsIter in interface MaximalIndependentSetsEnumerator
    
    Type Parameters:
    
    V - the vertices type
    
    E - the edges type
    
    Parameters:
    
    g - a graph
    
    Returns:
    
    an iterator that iterates over all maximal independent sets in the graph