File: union.igraph.vs.Rd

package info (click to toggle)
r-cran-igraph 1.0.1-1~bpo8%2B1
  • links: PTS, VCS
  • area: main
  • in suites: jessie-backports
  • size: 18,160 kB
  • sloc: ansic: 173,529; cpp: 19,365; fortran: 4,550; yacc: 1,164; tcl: 931; lex: 484; makefile: 149; sh: 9
file content (49 lines) | stat: -rw-r--r-- 1,505 bytes parent folder | download | duplicates (2)
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
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/iterators.R
\name{union.igraph.vs}
\alias{union.igraph.vs}
\title{Union of vertex sequences}
\usage{
\method{union}{igraph.vs}(...)
}
\arguments{
\item{...}{The vertex sequences to take the union of.}
}
\value{
A vertex sequence that contains all vertices in the given
sequences, exactly once.
}
\description{
Union 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. (This is to match the behavior of the based \code{unique}
function.)
}
\examples{
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
union(V(g)[1:6], V(g)[5:10])
}
\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{intersection.igraph.vs}};
  \code{\link{rev.igraph.es}}; \code{\link{rev.igraph.vs}};
  \code{\link{union.igraph.es}};
  \code{\link{unique.igraph.es}};
  \code{\link{unique.igraph.vs}}
}