Python Hey Trying Modify Code Fit Problem Need Solve Please Help Https Wwwgeeksforgeeksorg Q43834280
In Python!
Hey, so I am trying to modify this code to fit problem I need tosolve 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 givenany capacities I only need to find a minimal cut of graph (minimalset of vertices that need to be thrown out to separate graph intotwo components) but I still need sink on one side and tank on theother side. So I thought I would change all capacities to 1 in theadjacency graph,however, it doesn’t give me vertices I am lookingfor. (so the output should be the set of vertices NOT the set ofedges that need to be thrown out to separate this graph)
Hope you can help.Thanks.
Expert Answer
Answer to In Python! Hey, so I am trying to modify this code to fit problem I need to solve please help me : https://www.geeksforg…
OR