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
32
33
34
35
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/flow.R
\name{is_separator}
\alias{is_separator}
\alias{is.separator}
\title{Vertex separators}
\usage{
is_separator(graph, candidate)
}
\arguments{
\item{graph}{The input graph. It may be directed, but edge directions are
ignored.}
\item{candidate}{A numeric vector giving the vertex ids of the candidate
separator.}
}
\value{
A logical scalar, whether the supplied vertex set is a (minimal)
vertex separator or not.
}
\description{
Check whether a given set of vertices is a vertex separator.
}
\details{
\code{is_separator} decides whether the supplied vertex set is a vertex
separator. A vertex set is a vertex separator if its removal results a
disconnected graph.
In the special case of a fully connected graph with \eqn{n} vertices, each
set of \eqn{n-1} vertices is considered to be a vertex separator.
}
\seealso{
\code{\link{is_min_separator}}, \code{\link{min_separators}}
lists all vertex separator of minimum size.
}
|
