I am looking for an algorithm, when a given two nodes 's' and 't' in a undiredted graph, to find min-cut edges, which partitions the graph into two A and B, 's' will in A and 't' will in B.
I see most people suggesting for Ford–Fulkerson algorithm to for that task, at here. I am thinking is that is it possible to use Dinic's algorithm for it. Since Dinic's algorithm can be speed up with dynamic tree. Because I want to find min-cut edges with fastest way possible.
which algorithm is faster for to find min-cut edges in a huge undirected graph?
I would like to hear some advice while I am looking into the details for these algorithm.
Thanks in advance