igraph (version 1.2.1)

union.igraph.vs: Union of vertex sequences

Description

Union of vertex sequences

Usage

# S3 method for igraph.vs
union(...)

Arguments

...

The vertex sequences to take the union of.

Value

A vertex sequence that contains all vertices in the given sequences, exactly once.

Details

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.)

See Also

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

Examples

Run this code
# 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 DataCamp Workspace