bctpy
bctpy copied to clipboard
Does bct.efficiency_wei also work for directed networks?
I would like to compute the global efficiency for a set of directed matrices. Looking at the appendix of this this paper, it seems that bct.efficiency_wei
is agnostic to direction (aka. can be used for both directed and undirected networks?). If so, I guess the documentation should be changed to undirected/directed
weighted connection matrix?:
https://github.com/aestrivex/bctpy/blob/afac15fb72a0d7cb996461df304fd05a16f03e8e/bct/algorithms/distance.py#L560-L562
I never thought of doing it for directed networks. It appears to me that the algorithm could accommodate directed matrices. However, that algorithm is a bit more complicated than the one currently written, it would have to compute distances between pairs of vertices directionally. A bit of work will be needed to make it do that.
Pull requests are always welcome.