Description Usage Arguments Author(s)
Count edges within a graph or edges between two non-overlapping graphs
1 | count_edges(G, v1, v2 = NULL, edges = FALSE)
|
G |
igraph which contains vertex identified by 'v1' and 'v2'. |
v1 |
vector of vertex identifiers. |
v2 |
vector of vertex identifiers. 'NULL' by default, but when a second vector is supplied, the fuction will return the number of edges connecting the two subgraphs indicated by the vertex lists. |
edges |
logical. If TRUE, the edges rather than the count will be returned as a data.frame with two columns named "vi" and "vj". |
Christopher Nobles, Ph.D.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.