shortestPath_all.multiplex: Shortest paths between all vertices in the multiplex network
In Issamfalih/MUNA: MUNA: A Multiplex Network Analysis Library

Description Usage Arguments Value Author(s) Examples

Shortest paths between vertices in the multiplex network. The shortest paths will be calculated in a flatten graph. The shortest path length from a vertex to itself is always zero. For unreachable vertices Inf is included

1	shortestPath_all.multiplex(multiplex,flatten_function)

`multiplex`	: The multiplex object.
`flatten_function`	: String, the name of the flatten function

Numeric square matrix with length of multiplex nodes

Issam Falih <issam.falih@lipn.univ-paris13.fr>

1
2
3

M <- Multiplex_Lazega
shortestPath_all.multiplex(M,flatten_function = flatten_binary)
shortestPath_all.multiplex(M,flatten_function = flatten_redundancy)