FindAllCG uses FindCG iteratively, and lists all the connected subgraphs with no more than lc nodes

1 | ```
FindAllCG(adjacency.matrix, lc)
``` |

`adjacency.matrix` |
p by p adjacency matrix of an undirected graph; it must be symmetric. |

`lc` |
the maximal size of the connected subgraphs to be listed |

`cg.all` |
A list, whose kth component is a matrix with k columns that lists all the connected subgraphs with k nodes. |

`FindCG`

1 2 3 4 5 |

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.