Package org.jgrapht.alg
Class BronKerboschCliqueFinder<V,E>
java.lang.Object
org.jgrapht.alg.BronKerboschCliqueFinder<V,E>
This class implements Bron-Kerbosch clique detection algorithm as it is
described in [Samudrala R.,Moult J.:A Graph-theoretic Algorithm for
comparative Modeling of Protein Structure; J.Mol. Biol. (1998); vol 279; pp.
287-302]
- Author:
- Ewgenij Proschak
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionCollection
<Set<V>> Finds all maximal cliques of the graph.Collection
<Set<V>> Finds the biggest maximal cliques of the graph.
-
Constructor Details
-
BronKerboschCliqueFinder
Creates a new clique finder.- Parameters:
graph
- the graph in which cliques are to be found; graph must be simple
-
-
Method Details
-
getAllMaximalCliques
Finds all maximal cliques of the graph. A clique is maximal if it is impossible to enlarge it by adding another vertex from the graph. Note that a maximal clique is not necessarily the biggest clique in the graph.- Returns:
- Collection of cliques (each of which is represented as a Set of vertices)
-
getBiggestMaximalCliques
Finds the biggest maximal cliques of the graph.- Returns:
- Collection of cliques (each of which is represented as a Set of vertices)
-