Subgraph of a graph
subgraph creates a subgraph of a graph, containing
only the specified vertices and all the edges among them.
induced.subgraph(graph, vids, impl=c("auto", "copy_and_delete", "create_from_scratch")) subgraph.edges(graph, eids, delete.vertices = TRUE) subgraph(graph, v)
- The original graph.
- Numeric vector, the vertices of the original graph which will form the subgraph.
- Character scalar, to choose between two
implementation of the subgraph
copies the graph first, and then deletes the vertices and edges that are not included in the result graph. <
- The edge ids of the edges that will be kept in the result graph.
- Logical scalar, whether to remove vertices
that do not have any adjacent edges in
induced.subgraph calculates the induced subgraph of a set of
vertices in a graph. This means that exactly the specified vertices
and all the edges between then will be kept in the result graph.
subgraph.edges calculates the subgraph of a graph. For this
function one can specify the vertices and edges to keep. This
function will be renamed to
subgraph in the next major
version of igraph.
subgraph function does the same as
argument), but it is deprecated and will be removed in the next
major version of igraph.
- A new graph object.
g <- graph.ring(10) g2 <- induced.subgraph(g, 1:7) g3 <- subgraph.edges(g, 1:5, 1:5)