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
49
50
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/operators.R
\name{intersection}
\alias{intersection}
\title{Intersection of two or more sets}
\usage{
intersection(...)
}
\arguments{
\item{...}{Arguments, their number and interpretation depends on
the function that implements \code{intersection()}.}
}
\value{
Depends on the function that implements this method.
}
\description{
This is an S3 generic function. See \code{methods("intersection")}
for the actual implementations for various S3 classes. Initially
it is implemented for igraph graphs and igraph vertex and edge
sequences. See
\code{\link[=intersection.igraph]{intersection.igraph()}}, and
\code{\link[=intersection.igraph.vs]{intersection.igraph.vs()}}.
}
\seealso{
Other functions for manipulating graph structure:
\code{\link{+.igraph}()},
\code{\link{add_edges}()},
\code{\link{add_vertices}()},
\code{\link{complementer}()},
\code{\link{compose}()},
\code{\link{connect}()},
\code{\link{contract}()},
\code{\link{delete_edges}()},
\code{\link{delete_vertices}()},
\code{\link{difference}()},
\code{\link{difference.igraph}()},
\code{\link{disjoint_union}()},
\code{\link{edge}()},
\code{\link{igraph-minus}},
\code{\link{intersection.igraph}()},
\code{\link{path}()},
\code{\link{permute}()},
\code{\link{rep.igraph}()},
\code{\link{reverse_edges}()},
\code{\link{simplify}()},
\code{\link{union}()},
\code{\link{union.igraph}()},
\code{\link{vertex}()}
}
\concept{functions for manipulating graph structure}
|
