Gomory Hu implementation

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view

Gomory Hu implementation

Mads Jensen

I'm trying to get an implementation of the Gomory-Hu minimum cut tree
running, as rejuvenated by Gusfield. I'm having trouble to get the code
to run. I tried to use the example from the Python Igraph (I've modified
the Python code to iteratively print values of the s-cut and t-cut, and
neighbors. The odd thing about my code is that in the very first S-T cut
computation, it should be 6, but it's yielding 4, but for the second
run, it's correct. I don't understand that first part with the cut.
Thank you.

It's my goal to open a pull request for the code, in a cleaned-up form;
I started writing the code with a TestCase, but as the test-case kept
failing, and no output is printed when running "mvn test".
Med venlig hilsen / Kind regards,
Mads Jensen

     Saajan Fernandes: I think we forget things if there is nobody to
                       tell them.
     -- The Lunchbox (2013)

Site24x7 APM Insight: Get Deep Visibility into Application Performance
APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
Monitor end-to-end web transactions and take corrective actions now
Troubleshoot faster and improve end-user experience. Signup Now!
jgrapht-users mailing list
[hidden email]

GomoryHuCutTree.java (6K) Download Attachment
MainRunner.java (2K) Download Attachment
gomory_hu.py (2K) Download Attachment