forward method to decompose the weighted graph into single connected graphs

Share:

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 <haydi@126.com>

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

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.