How to find negative cycle with most sum of its edge weights (with absolute value) in a graph. In particular for the problem minimum cost flow(circulation) with solution negative cost cycle canceling Russian English. Thanks in advance.