Intersection of vertex sequences

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

The vertex sequences to take the intersection of.

A vertex sequence that contains vertices that appear in all given sequences, each vertex 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.

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(), rev.igraph.es(), rev.igraph.vs(), union.igraph.es(), union.igraph.vs(), unique.igraph.es(), unique.igraph.vs()

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

rev.igraph.es()

rev.igraph.vs()

union.igraph.es()

union.igraph.vs()

unique.igraph.es()

unique.igraph.vs()

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

Run the code above in your browser using DataCamp Workspace