P186: Enumeration of all $(s, t)$-cuts in an weighted directed graph

P186: Enumeration of all $(s, t)$-cuts in an weighted directed graph
Input:
An weighted directed graph $G = (V, E)$.
Output:
All cuts in $G$ by non-decreasing weights ordering.
Complexity:
$O(|V||E|\log(|V|^2/|E|))$ delay.
Comment:
Reference:
[Yeh2010] (Bibtex)