distance_w

logical, whether the network is directed or undirected. Default is NULL, this means that the function checks whether the edgelist is directed or not.

directed

logical, whether the function should only be calculated for the giant component. Default is TRUE.

gconly

Whether a only a subset of starting nodes should we used when calculating the measure. This is particularly useful when running out of memory analysing large networks. If it is set to 1, all distances are analysed. If it set to a value below one, this is 

subsample

If a subset of starting nodes is analysed, by setting this parameter, the results are reproducable.

seed

The shortest path length, or geodesic distance, between two nodes in a binary network is the minimum number of steps you need to make to go from one of them to the other. This distance is the quickest connection between nodes when all ties are the same. However, in a weighted network, all ties are not the same. See http://toreopsahl.com/2009/01/09/average-shortest-distance-in-weighted-networks/ for more deatails.

Bipartite provides functions to visualise webs and calculate a series of indices commonly used to describe pattern in ecological webs. It focuses on webs consisting of only two trophic levels, e.g. pollination webs or predator-prey-webs. Visualisation is important to get an idea of what we are actually looking at, while the indices summarise different aspects of the webs topology. 

distance_w: Distance in a weighted network

Description

Usage

Arguments

Value

References