[Boost-users] adjacency matrix subgraph enumeration

What is the best way in boost to enumerate all connected subgraphs of an adjacency matrix? I know in advance that all nodes of the graph are connected and that it is cyclic. For the following graph: (0 <-> 1) (1 <-> 2) (2 <-> 3) (3 <-> 0) I want to enumerate the node list of all unique connected subgraphs: (0, 1) (0, 1, 2) (0, 1, 2, 3) (1, 2) (1, 2, 3) (2, 3) (0, 3) (0, 3, 2) -- View this message in context: http://boost.2283326.n4.nabble.com/adjacency-matrix-subgraph-enumeration-tp4... Sent from the Boost - Users mailing list archive at Nabble.com.