loop.random

gemat


At each step, a random one of all candidate nodes was chosen 
when finding next node in the process of making a single connected graph.
This method can allow us to obtain different decomposition results possibly.
In contrast, the method used in 'loop.forward' function will always return only
one possibility of decomposition.
This algorithm is the one employed in the function 'decomp'.
Next version will use function 'uniquepaths' to get all possible decompositions
at the same time.


The program can perform loop analysis and plot network
structure (especially for food webs),including minimum spanning
tree, loop decomposition of weighted directed graphs, and other
network properties which may be related to food chain
properties in ecology.

Youhua Chen

loop

loop decomposition of weighted directed graphs for life cycle
analysis, providing flexbile network plotting methods, and
analyzing food chain properties in ecology

loop.random: a random method to decompose the weighted graph into single connected graphs

Description

Usage

Arguments

References

See Also