1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/cliques.R
\name{maximal.cliques.count}
\alias{maximal.cliques.count}
\title{Functions to find cliques, i.e. complete subgraphs in a graph}
\usage{
maximal.cliques.count(graph, min = NULL, max = NULL, subset = NULL)
}
\arguments{
\item{graph}{The input graph, directed graphs will be considered as
undirected ones, multiple edges and loops are ignored.}
\item{min}{Numeric constant, lower limit on the size of the cliques to find.
\code{NULL} means no limit, i.e. it is the same as 0.}
\item{max}{Numeric constant, upper limit on the size of the cliques to find.
\code{NULL} means no limit.}
\item{subset}{If not \code{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.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
\code{maximal.cliques.count()} was renamed to \code{count_max_cliques()} to create a more
consistent API.
}
\keyword{internal}
|
