Interface MaximalCliqueEnumerationAlgorithm<V,​E>

Type Parameters:
V - the graph vertex type
E - the graph edge type
All Superinterfaces:
java.lang.Iterable<java.util.Set<V>>
All Known Implementing Classes:
BronKerboschCliqueFinder, DegeneracyBronKerboschCliqueFinder, PivotBronKerboschCliqueFinder

public interface MaximalCliqueEnumerationAlgorithm<V,​E>
extends java.lang.Iterable<java.util.Set<V>>
A maximal clique enumeration algorithm.
Author:
Dimitrios Michail
  • Method Summary

    Modifier and Type Method Description
    java.util.Iterator<java.util.Set<V>> iterator()
    Returns an iterator over all maximal cliques.

    Methods inherited from interface java.lang.Iterable

    forEach, spliterator
  • Method Details

    • iterator

      java.util.Iterator<java.util.Set<V>> iterator()
      Returns an iterator over all maximal cliques.
      Specified by:
      iterator in interface java.lang.Iterable<V>
      Returns:
      an iterator over all maximal cliques