ShortestPaths: Path lengths
In quicklizard99/cheddar: Analysis and Visualisation of Ecological Communities

View source: R/community_trophic_links.R

ShortestPaths

R Documentation

Path lengths

Description

Functions that compute the shortest trophic paths between nodes.

Usage

ShortestPaths(community, weight.by=NULL)
CharacteristicPathLength(community)

Arguments

`community`	an object of class `Community`.
`weight.by`	the name of a property by which to weight paths.

Details

ShortestPaths uses Dijkstra's algorithm to compute the number of trophic links between each pair of nodes in the food web. CharacteristicPathLength returns the mean of path lengths.

Value

A square matrix with NumberOfNodes rows and columns or a single number.

Author(s)

Lawrence Hudson

References

Williams, R.J. and Berlow, E.L. and Dunne, J.A. and Barab\'asi, A.L. and Martinez, N.D. (2002) Two degrees of separation in complex food webs. Proceedings of the National Academy of Sciences of the United States of America 99, 20, 12913–12916

Examples

data(Benguela)

# Compare weighted and unweighted
ShortestPaths(Benguela)
ShortestPaths(Benguela, weight.by='diet.fraction')

CharacteristicPathLength(Benguela)

quicklizard99/cheddar documentation built on Aug. 25, 2022, 5:01 a.m.