% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/motifs.R
\name{count_motifs}
\alias{count_motifs}
\title{Graph motifs}
\usage{
count_motifs(graph, size = 3, cut.prob = NULL)
}
\arguments{
\item{graph}{Graph object, the input graph.}

\item{size}{The size of the motif.}

\item{cut.prob}{Numeric vector giving the probabilities that the search
graph is cut at a certain level. Its length should be the same as the size
of the motif (the \code{size} argument).
If \code{NULL}, the default, no cuts are made.}
}
\value{
\code{count_motifs()} returns  a numeric scalar.
}
\description{
Graph motifs are small connected induced subgraphs with a well-defined
structure.  These functions search a graph for various motifs.
}
\details{
\code{count_motifs()} calculates the total number of motifs of a given
size in graph.
}
\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_no}{\code{motifs_randesu_no()}}
}

\examples{
g <- sample_pa(100)
motifs(g, 3)
count_motifs(g, 3)
sample_motifs(g, 3)
}
\seealso{
\code{\link[=isomorphism_class]{isomorphism_class()}}

Other graph motifs: 
\code{\link{dyad_census}()},
\code{\link{motifs}()},
\code{\link{sample_motifs}()}
}
\concept{graph motifs}
