Good day. I need to find all possible sections of the graph. Is there a solution to this problem? I would be grateful for the help!
- What is a graph cut in your understanding? - pavel
- Try to write more detailed questions. Explain exactly what you see the problem, how to reproduce it, what you want to get as a result, etc. - Nicolas Chabanovsky ♦
- A subset of edges whose removal will make the graph disconnected. More precisely, I need to find all the basic cuts. Found a code that uses a spanning tree. But this decision does not indicate all cuts. For example, if a graph is given, consisting of 4 vertices connected in the form of a square, the solution gives only 3 cuts, instead of the required 6, because one spanning tree is used. Is it possible to use this method to find all cuts? - Nigar
|