loop.forward: forward method to decompose the weighted graph into single...

Description Usage Arguments Author(s) References See Also

View source: R/loop.R

Description

At each step, only choose the first one of all candidate nodes when finding next node in the process of making a single connected graph. This is an internal function.

Usage

1
loop.forward(gemat)

Arguments

gemat

square graph matrix form

Author(s)

Youhua Chen <[email protected]>

References

van Groenendael J, de Kroon H, Kalisz S, Tuljapurkar S (1994) Loop analysis: evaluating life history pathways in population projection matrices. Ecology, 75, 2410-2415.

Sun L, Wang M (2007) An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in Ecology. Journal of Mathematical Biology, 54, 199-226.

Chen Y (2012) loop: an R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting. Submitted.

See Also

decomp, gplot, loop.random


loop documentation built on May 29, 2017, 11:20 p.m.