shortestPath_mean.multiplex: Average shortest paths between vertices over all layers in...

In Issamfalih/MUNA: MUNA: A Multiplex Network Analysis Library

Description

Average shortest paths between 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

Usage

shortestPath_mean.multiplex(multiplex,nodei,nodej)

Arguments

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

Value

Numeric scalar

Author(s)

Issam Falih <[e-mail]>

Examples

M <- Multiplex_Lazega
shortestPath_mean.multiplex(M,"1","34")

Issamfalih/MUNA documentation built on May 8, 2019, 11:52 a.m.