brainconn.distance
.breadthdist¶
-
breadthdist
(CIJ)[source]¶ The binary reachability matrix describes reachability between all pairs of nodes. An entry (u,v)=1 means that there exists a path from node u to node v; alternatively (u,v)=0.
The distance matrix 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.
Parameters: CIJ (NxN numpy.ndarray
) – binary directed/undirected connection matrixReturns: - R (NxN
numpy.ndarray
) – binary reachability matrix - D (NxN
numpy.ndarray
) – distance matrix
Notes
slower but less memory intensive than “reachdist.m”.
- R (NxN