I'm looking for find the min-cut of a fully-connected directed graph (with cycles), or an undirected graph.Karger's works but is not guaranteed to produce the correct solution. Is there a guaranteed algorithm?I came across max-flow algorithms. Do these only work if the graph is acyclic?Thanks.
Is there a guaranteed min-cut algorithm for weighted graph or weighted cyclical digraph?
graph theory