Package com.jgalgo.alg.clique

Class MaximalCliquesEnumeratorAbstract

java.lang.Object

com.jgalgo.alg.clique.MaximalCliquesEnumeratorAbstract

All Implemented Interfaces:

MaximalCliquesEnumerator

Direct Known Subclasses:

MaximalCliquesEnumeratorBronKerbosch, MaximalCliquesEnumeratorBronKerboschPivot

public abstract class MaximalCliquesEnumeratorAbstract
extends Object
implements MaximalCliquesEnumerator

Abstract class for enumerating over all maximal cliques 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
MaximalCliquesEnumeratorAbstract()	Default constructor.

Method Summary

Modifier and Type	Method	Description
<V, E> Iterator<Set<V>>	maximalCliquesIter(Graph<V,E> g)	Iterate over all maximal cliques in a graph.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

MaximalCliquesEnumeratorAbstract

public MaximalCliquesEnumeratorAbstract()

Default constructor.

Method Details

maximalCliquesIter

public <V,
E> Iterator<Set<V>> maximalCliquesIter(Graph<V,E> g)

Description copied from interface: MaximalCliquesEnumerator

Iterate over all maximal cliques 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:

maximalCliquesIter in interface MaximalCliquesEnumerator

Type Parameters:

V - the vertices type

E - the edges type

Parameters:

g - a graph

Returns:

an iterator that iterates over all maximal cliques in the graph