% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/topology.R
\name{count_subgraph_isomorphisms}
\alias{count_subgraph_isomorphisms}
\alias{graph.count.subisomorphisms.vf2}
\title{Count the isomorphic mappings between a graph and the subgraphs of
another graph}
\usage{
count_subgraph_isomorphisms(pattern, target, method = c("lad", "vf2"), ...)
}
\arguments{
\item{pattern}{The smaller graph, it might be directed or
undirected. Undirected graphs are treated as directed graphs with
mutual edges.}

\item{target}{The bigger graph, it might be directed or
undirected. Undirected graphs are treated as directed graphs with
mutual edges.}

\item{method}{The method to use. Possible values:
\sQuote{lad}, \sQuote{vf2}. See their details below.}

\item{...}{Additional arguments, passed to the various methods.}
}
\value{
Logical scalar, \code{TRUE} if the \code{pattern} is
isomorphic to a (possibly induced) subgraph of \code{target}.
}
\description{
Count the isomorphic mappings between a graph and the subgraphs of
another graph
}
\section{\sQuote{lad} method}{

This is the LAD algorithm by Solnon, see the reference below. It has
the following extra arguments:
\describe{
\item{domains}{
If not \code{NULL}, then it specifies matching restrictions.
It must be a list of \code{target} vertex sets, given as numeric vertex ids or symbolic vertex names.
The length of the list must be \code{vcount(pattern)} and for each vertex in \code{pattern}
it gives the allowed matching vertices in \code{target}.
Defaults to \code{NULL}.
}
\item{induced}{
Logical scalar, whether to search for an induced subgraph. It is \code{FALSE} by default.
}
\item{time.limit}{
The processor time limit for the computation, in seconds. It defaults to \code{Inf}, which means no limit.
}
}
}

\section{\sQuote{vf2} method}{

This method uses the VF2 algorithm by Cordella, Foggia et al., see
references below. It supports vertex and edge colors and have the
following extra arguments:
\describe{
\item{vertex.color1, vertex.color2}{
Optional integer vectors giving the colors of the vertices for colored graph isomorphism.
If they are not given, but the graph has a \dQuote{color} vertex attribute, then it will be used.
If you want to ignore these attributes, then supply \code{NULL} for both of these arguments.
See also examples below.
}
\item{edge.color1, edge.color2}{
Optional integer vectors giving the colors of the edges for edge-colored (sub)graph isomorphism.
If they are not given, but the graph has a \dQuote{color} edge attribute, then it will be used.
If you want to ignore these attributes, then supply \code{NULL} for both of these arguments.
}
}
}

\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_subisomorphisms_vf2}{\code{count_subisomorphisms_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
}

\references{
LP Cordella,  P Foggia, C Sansone, and M Vento: An improved algorithm
for matching large graphs, \emph{Proc. of the 3rd IAPR TC-15 Workshop
on Graphbased Representations in Pattern Recognition}, 149--159, 2001.

C. Solnon: AllDifferent-based Filtering for Subgraph Isomorphism,
\emph{Artificial Intelligence} 174(12-13):850--864, 2010.
}
\seealso{
Other graph isomorphism: 
\code{\link{canonical_permutation}()},
\code{\link{count_isomorphisms}()},
\code{\link{graph_from_isomorphism_class}()},
\code{\link{isomorphic}()},
\code{\link{isomorphism_class}()},
\code{\link{isomorphisms}()},
\code{\link{subgraph_isomorphic}()},
\code{\link{subgraph_isomorphisms}()}
}
\concept{graph isomorphism}
