A flow network is a directed graph where each edge has a capacity and each edge receives a flow.
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 © 2017. All rights reserved.