Implementation of <a href = "https://en.wikipedia.org/wiki/Dinic%27s_algorithm">Dinic algorithm</a> with scaling for <a href = "https://en.wikipedia.org/wiki/Maximum_flow_problem"maximum"maximum flow problem</a>.
This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.
This class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield.
Implementation of the algorithm by Padberg and Rao to compute Odd Minimum Cut-Sets.
Push-relabel maximum flow algorithm designed by Andrew V.
Copyright © 2019. All rights reserved.