Question: In Python! Hey, so I am trying to modify this code to fit problem I need to solve please help me : https://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/ I want
In Python!
Hey, so I am trying to modify this code to fit problem I need to solve please help me :
https://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/
I want to find a minimal cut of a graph that has not been given any capacities I only need to find a minimal cut of graph (minimal set of vertices that need to be thrown out to separate graph into two components) but I still need sink on one side and tank on the other side. So I thought I would change all capacities to 1 in the adjacency graph,however, it doesn't give me vertices I am looking for. (so the output should be the set of vertices NOT the set of edges that need to be thrown out to separate this graph)
Hope you can help.Thanks.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
