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
36
37
38
39
40
41
42
43
44
45
46
47
48
|
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/iterators.R
\name{intersection.igraph.vs}
\alias{intersection.igraph.vs}
\title{Intersection of vertex sequences}
\usage{
\method{intersection}{igraph.vs}(...)
}
\arguments{
\item{...}{The vertex sequences to take the intersection of.}
}
\value{
A vertex sequence that contains vertices that appear in all
given sequences, each vertex exactly once.
}
\description{
Intersection of vertex sequences
}
\details{
They must belong to the same graph. Note that this function has
\sQuote{set} semantics and the multiplicity of vertices is lost in the
result.
}
\examples{
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
intersection(E(g)[1:6], E(g)[5:9])
}
\seealso{
Other vertex and edge sequence operations: \code{\link{[.igraph.es}},
\code{\link{\%--\%}}, \code{\link{\%->\%}},
\code{\link{\%<-\%}}, \code{\link{igraph-es-indexing}};
\code{\link{[.igraph.vs}},
\code{\link{igraph-vs-indexing}};
\code{\link{[[.igraph.es}},
\code{\link{igraph-es-indexing2}};
\code{\link{[[.igraph.vs}},
\code{\link{igraph-vs-indexing2}};
\code{\link{c.igraph.es}}; \code{\link{c.igraph.vs}};
\code{\link{difference.igraph.es}};
\code{\link{difference.igraph.vs}};
\code{\link{intersection.igraph.es}};
\code{\link{rev.igraph.es}}; \code{\link{rev.igraph.vs}};
\code{\link{union.igraph.es}};
\code{\link{union.igraph.vs}};
\code{\link{unique.igraph.es}};
\code{\link{unique.igraph.vs}}
}
|
