I'm trying to work on a Network Optimization Problem, where I need to create all distinct Subgraphs of a provided graph (The Graph is complete in itself and is of undirected nature with symmetric edge weights). In order to ensure the connectivity, distinct set of edges need to mapped to all these individual subgraphs, which are coincident into them. A coincident edge is considered as an edge whose one terminal node is present in the mapped subgraph and other terminal node in the complement (of the subgraph).
I'm facing implementation issues in python, as I'm not able to enumerate all such coincident edges for every distinct subgraph. I need the mapped set of these edges to deploy constraints in Gurobi solver with python. I'm clueless about this task, as I'm relatively new to python and Gurobi.
In case the NETWORKX module has an inbuilt function for such task, then duly provide the info about it and possible implementation
