It will return all connected graphs, and a unconnected graph
1  decomp(gemat)

gemat 
the square graph matrix 
return all single connected directed graphs and a final nondecomposable graph
Youhua Chen <haydi@126.com>
van Groenendael J, de Kroon H, Kalisz S, Tuljapurkar S (1994) Loop analysis: evaluating life history pathways in population projection matrices. Ecology, 75, 24102415.
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, 199226.
Chen Y (2012) loop: an R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting. Submitted.
gplot
,
fplot
,
fplot.foodweb
,
loop.forward
,
loop.random
1 2 3 
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
All documentation is copyright its authors; we didn't write any of that.