Package org.graph4j.clique

Class DFSCliqueIterator

java.lang.Object

org.graph4j.SimpleGraphAlgorithm

org.graph4j.clique.DFSCliqueIterator

All Implemented Interfaces:

CliqueIterator

public class DFSCliqueIterator
extends SimpleGraphAlgorithm
implements CliqueIterator

Iterates over all cliques in a graph in a DFS manner. The cliques are ordered lexicographically by their sequence of numbers.

Author:

Cristian Frăsinaru

Field Summary

Fields inherited from class org.graph4j.SimpleGraphAlgorithm

graph

Constructor Summary

Constructors

Constructor	Description
DFSCliqueIterator(Graph graph)
DFSCliqueIterator(Graph graph, int minSize, int maxSize)
DFSCliqueIterator(Graph graph, int minSize, int maxSize, long timeout)

Method Summary

Modifier and Type	Method	Description
boolean	hasNext()
Clique	next()

Methods inherited from class org.graph4j.SimpleGraphAlgorithm

getGraph

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface org.graph4j.clique.CliqueIterator

getAll

Constructor Details

DFSCliqueIterator

public DFSCliqueIterator(Graph graph)

DFSCliqueIterator

public DFSCliqueIterator(Graph graph,
 int minSize,
 int maxSize)

Parameters:

graph - the input graph.

minSize - the minimum size of a clique.

maxSize - the maximum size of a clique.

DFSCliqueIterator

public DFSCliqueIterator(Graph graph,
 int minSize,
 int maxSize,
 long timeout)

Parameters:

graph - the input graph.

minSize - the minimum size of a clique.

maxSize - the maximum size of a clique.

timeout - timeout in milliseconds.

Method Details

next

public Clique next()

Specified by:

next in interface CliqueIterator

Returns:

the next element in the iteration.

hasNext

public boolean hasNext()

Specified by:

hasNext in interface CliqueIterator

Returns:

true if the iteration has more elements.