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

In igraph/rigraph: Network Analysis and Visualization

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

Description

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

Usage

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

Arguments

graph	The input graph, directed graphs will be considered as undirected ones, multiple edges and loops are ignored.
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.
file	If not NULL, then it must be a file name, i.e. a character scalar. The output of the algorithm is written to this file. (If it exists, then it will be overwritten.) Each clique will be a separate line in the file, given with the numeric ids of its vertices, separated by whitespace.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.