Interface CliqueIterator

All Known Subinterfaces:
MaximalCliqueIterator
All Known Implementing Classes:
BFSCliqueIterator, BoundedCliqueIterator, BronKerboschCliqueIterator, DFSCliqueIterator

public interface CliqueIterator
Iterates over all cliques of a graph. Additional constraints, such as the minimum or maximum size of a clique, can be imposed.
Author:
Cristian Frăsinaru
  • Method Summary

    Modifier and Type
    Method
    Description
    default List<Clique>
    Obtains a list of all cliques which would be returned by the iterator.
     
    boolean
     
     
  • Method Details

    • hasNext

      boolean hasNext()
      Returns:
      true if the iteration has more elements.
    • next

      Clique next()
      Returns:
      the next element in the iteration.
    • getAll

      default List<Clique> getAll()
      Obtains a list of all cliques which would be returned by the iterator. imposed constraints. This list can be exponential in the number of nodes in the graph.
      Returns:
      all cliques of the graph.
    • getInstance

      static CliqueIterator getInstance(Graph graph)
      Parameters:
      graph - the input graph.
      Returns:
      the default implementation of this interface.