Skip to contents

Functions to find cliques, i.e. complete subgraphs in a graph

Source: R/cliques.R
maximal.cliques.count.Rd

[Deprecated]

maximal.cliques.count() was renamed to count_max_cliques() to create a more consistent API.

Usage

maximal.cliques.count(graph, min = NULL, max = NULL, subset = NULL)

Arguments

graph

The input graph.

min

Numeric constant, lower limit on the size of the cliques to find. NULL means no limit, i.e. it is the same as 0.

max

Numeric constant, upper limit on the size of the cliques to find. NULL means no limit.

subset

If not NULL, then it must be a vector of vertex ids, numeric or symbolic if the graph is named. The algorithm is run from these vertices only, so only a subset of all maximal cliques is returned. See the Eppstein paper for details. This argument makes it possible to easily parallelize the finding of maximal cliques.

vcount()