Description Usage Arguments Details Value Examples

View source: R/diffnet-methods.r

Count the number of vertices/edges/slices in a graph

1 2 3 4 5 6 7 8 9 |

`graph` |
Any class of accepted graph format (see |

`nnodes`

and `nlinks`

are just aliases for `nvertices`

and
`nedges`

respectively.

For `nvertices`

and `nslices`

, an integer scalar equal to the number
of vertices and slices in the graph. Otherwise, from `nedges`

, either a list
of size *t* with the counts of edges (non-zero elements in the adjacency matrices) at
each time period, or, when `graph`

is static, a single scalar with
such number.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 | ```
# Creating a dynamic graph (we will use this for all the classes) -----------
set.seed(13133)
diffnet <- rdiffnet(100, 4)
# Lets use the first time period as a static graph
graph_mat <- diffnet$graph[[1]]
graph_dgCMatrix <- methods::as(graph_mat, "dgCMatrix")
# Now lets generate the other dynamic graphs
graph_list <- diffnet$graph
graph_array <- as.array(diffnet) # using the as.array method for diffnet objects
# Now we can compare vertices counts
nvertices(diffnet)
nvertices(graph_list)
nvertices(graph_array)
nvertices(graph_mat)
nvertices(graph_dgCMatrix)
# ... and edges count
nedges(diffnet)
nedges(graph_list)
nedges(graph_array)
nedges(graph_mat)
nedges(graph_dgCMatrix)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.