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
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/structural.properties.R
\name{is.maximal.matching}
\alias{is.maximal.matching}
\title{Matching}
\usage{
is.maximal.matching(graph, matching, types = NULL)
}
\arguments{
\item{graph}{The input graph. It might be directed, but edge directions will
be ignored.}
\item{matching}{A potential matching. An integer vector that gives the
pair in the matching for each vertex. For vertices without a pair,
supply \code{NA} here.}
\item{types}{Vertex types, if the graph is bipartite. By default they
are taken from the \sQuote{\code{type}} vertex attribute, if present.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
\code{is.maximal.matching()} was renamed to \code{is_max_matching()} to create a more
consistent API.
}
\keyword{internal}
|
