igraph (version 1.0.1)

union.igraph.es: Union of edge sequences

Description

Union of edge sequences

Usage

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

Arguments

...

The edge sequences to take the union of.

Value

An edge sequence that contains all edges 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 edges is lost in the result. (This is to match the behavior of the based unique function.)

See Also

Other vertex and edge sequence operations: [.igraph.es, %--%, %->%, %<-%, igraph-es-indexing; [.igraph.vs, igraph-vs-indexing; [[.igraph.es, igraph-es-indexing2; [[.igraph.vs, igraph-vs-indexing2; c.igraph.es; c.igraph.vs; difference.igraph.es; difference.igraph.vs; intersection.igraph.es; intersection.igraph.vs; rev.igraph.es; rev.igraph.vs; union.igraph.vs; unique.igraph.es; unique.igraph.vs

Examples

# NOT RUN {
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
union(E(g)[1:6], E(g)[5:9], E(g)['A|J'])
# }

Run the code above in your browser using DataCamp Workspace