breadthdist: Binary Reachibility Matrix
In ncullen93/bctR: Brain Connectivity Toolbox in R

Description Usage Arguments Details Value

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.

1	breadthdist(CIJ)

CIJ

: 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.

ncullen93/bctR documentation built on May 23, 2019, 1:28 p.m.