union.igraph.es | R Documentation |
Union of edge sequences
## S3 method for class 'igraph.es'
union(...)
... |
The edge sequences to take the union of. |
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.)
An edge sequence that contains all edges in the given sequences, exactly once.
Other vertex and edge sequence operations:
c.igraph.es()
,
c.igraph.vs()
,
difference.igraph.es()
,
difference.igraph.vs()
,
igraph-es-indexing
,
igraph-es-indexing2
,
igraph-vs-indexing
,
igraph-vs-indexing2
,
intersection.igraph.es()
,
intersection.igraph.vs()
,
rev.igraph.es()
,
rev.igraph.vs()
,
union.igraph.vs()
,
unique.igraph.es()
,
unique.igraph.vs()
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
union(E(g)[1:6], E(g)[5:9], E(g)["A|J"])
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.