Package com.jgalgo.alg.clique
Algorithms for solving cliques and independent sets problems.
-
Interface Summary Interface Description MaximalCliquesEnumerator Algorithm for enumerating over all maximal cliques in a graph.MaximalIndependentSetsEnumerator Algorithm for enumerating over all maximal independent sets in a graph. -
Class Summary Class Description MaximalCliquesEnumeratorAbstract Abstract class for enumerating over all maximal cliques in a graph.MaximalCliquesEnumeratorBronKerbosch The Bron-Kerbosch algorithm for Maximal cliques.MaximalCliquesEnumeratorBronKerboschPivot The Bron-Kerbosch algorithm for Maximal cliques with the pivot heuristic.MaximalIndependentSetsEnumeratorAbstract Abstract class for enumerating over all maximal independent sets in a graph.MaximalIndependentSetsEnumeratorComplementCliques Compute the maximal independent sets of a graph by computing the maximal cliques of the complement graph.