shortestPath.multiplex: Shortest paths between two 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.multiplex(multiplex,nodei,nodej,flatten_function)

`multiplex`	: The multiplex object.
`nodei`	: Numeric vector, the vertex from which the shortest paths will be calculated.
`nodej`	: Numeric vector, the vertex to which the shortest paths will be calculated
`flatten_function`	: String, the name of the flatten function

Numeric scalar

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

1
2
3

M <- Multiplex_Lazega
shortestPath.multiplex(M,"1","34",flatten_function = flatten_binary)
shortestPath.multiplex(M,"1","34",flatten_function = flatten_redundancy)