'Finding all conected subgraphs formed through edges of a directed multigraph
I have a directed multigraph formed from a set of nodes V and a set of edges E. I'm trying to find all the possible connected subgraphs
where
and are not trivial, i.e.
.
I am trying to use networkx in python to do this. Currently the only approach I have found to do this is to find every possible combination of F and then check if it is connected subgraph. This obviously quickly becomes intractable as the number of edges increases. The graphs I am working with are not huge, typically consisting of 10-30 nodes and no more that 100 edges.
From what I understand this appears to be a clique problem. I have seen that there are some implementations in networkx such as nx.enumerate_all_cliques(G), however, it appears that this returns a set of nodes and not edges. Are there any algorithms which can be used for what I am trying to achieve?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|