Union of vertex sequences
# S3 method for igraph.vs
union(...)
The vertex sequences to take the union of.
A vertex sequence that contains all vertices in the given sequences, exactly once.
They must belong to the same graph. Note that this function has
‘set’ semantics and the multiplicity of vertices is lost in the
result. (This is to match the behavior of the based unique
function.)
Other vertex and edge sequence operations: c.igraph.es
,
c.igraph.vs
,
difference.igraph.es
,
difference.igraph.vs
,
igraph-es-indexing2
,
igraph-es-indexing
,
igraph-vs-indexing2
,
igraph-vs-indexing
,
intersection.igraph.es
,
intersection.igraph.vs
,
rev.igraph.es
, rev.igraph.vs
,
union.igraph.es
,
unique.igraph.es
,
unique.igraph.vs
# NOT RUN {
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
union(V(g)[1:6], V(g)[5:10])
# }
Run the code above in your browser using DataLab