Intersection of edge sequences
# S3 method for class 'igraph.es'
intersection(...)
An edge sequence that contains edges that appear in all given sequences, each edge exactly once.
They must belong to the same graph. Note that this function has ‘set’ semantics and the multiplicity of edges is lost in the result.
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.vs()
,
rev.igraph.es()
,
rev.igraph.vs()
,
union.igraph.es()
,
union.igraph.vs()
,
unique.igraph.es()
,
unique.igraph.vs()
g <- make_(ring(10), with_vertex_(name = LETTERS[1:10]))
intersection(E(g)[1:6], E(g)[5:9])
#> + 2/10 edges from 393769a (vertex names):
#> [1] E--F F--G