Hi there, I'm working in a cut-tree implementation of gomoryhu algorithm and I have to compute max-flow on the input graph. I read about efficiency of the push-relabel algorithm and I want to do some tests but I can't get this because all reverse edges have to capacity equals 0. Someone knows one way to workaround this restriction? Other max-flow algorithms in BGL (edmonds-karp and boykov-kolmogorov) don't have this restriction, what do them more fast than push-relabel implementation. Thanks