Description Usage Arguments Value Author(s) Examples
Average shortest paths between all vertices over all layers in the multiplex network. The shortest path length from a vertex to itself is always zero. For unreachable vertices Inf is included
1 | shortestPath_mean_all.multiplex(multiplex)
|
multiplex |
: The multiplex object. |
Numeric square matrix with length of multiplex nodes
Issam Falih <issam.falih@lipn.univ-paris13.fr>
1 2 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.