An implementation of the Gomory-Hu algorithm as proposed by Dan Gusfield and using LEDA library. We use Gomory-Hu tree algorithm in order to solve all-pair minimum cut problem for a given directed graph. In this example , we also use the Edmonds-Karp algorithm for finding the maximum flow between two nodes. In order to run the project you can use the makefile.