The binary reachability matrix 'R' describes reachibility between all pairs of nodes. An entry (u,v)=1 means that there exists a path from node u to node v, and (u,v)=0 means there does not.
: a matrix - binary (un)directed connection matrix
The distance matrix 'D' contains lengths of shortest paths between all pairs of nodes. An entry (u,v) represents the length of shortest path from node u to node v. The average shortest path length is the characteristic path length of the network.
RD : a list - RD has two elements: 'R' is the binary reachability matrix, and 'D' is the distance matrix.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.