|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.jgrapht.alg.BronKerboschCliqueFinder<V,E>
public class 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]
| Constructor Summary | |
|---|---|
BronKerboschCliqueFinder(Graph<V,E> graph)
Creates a new clique finder. |
|
| Method Summary | |
|---|---|
java.util.Collection<java.util.Set<V>> |
getAllMaximalCliques()
Finds all maximal cliques of the graph. |
java.util.Collection<java.util.Set<V>> |
getBiggestMaximalCliques()
Finds the biggest maximal cliques of the graph. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public BronKerboschCliqueFinder(Graph<V,E> graph)
graph - the graph in which cliques are to be found; graph must be
simple| Method Detail |
|---|
public java.util.Collection<java.util.Set<V>> getAllMaximalCliques()
public java.util.Collection<java.util.Set<V>> getBiggestMaximalCliques()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||