[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Gomory-Hu (python)

From: Tamás Nepusz
Subject: Re: [igraph] Gomory-Hu (python)
Date: Wed, 10 Jul 2013 13:54:41 +0200


Attached is a quick implementation of the Gomory-Hu tree calculation in Python. 
I haven't tested it too much (only with the example in Wikipedia), but I think 
it should be okay. Let me know if you run into any issues; if not, chances are 
that this will be converted into C at some point and then merged into the next 
igraph release.

All the best,

Attachment: gomory_hu.py
Description: Text Data

On 10 Jul 2013, at 11:45, Raphael C <address@hidden> wrote:

> I am interested in the Gomory-Hu tree  (
> http://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree ) of a graph.
> There are a few algorithms with the one by Gusfield apparently being
> very simple if you already have a max flow implementation. There is
> also source code here http://www.cs.princeton.edu/~kt/cut-tree/ .
> Would it be possible to add an implementation to python igraph by any
> chance please?  I hope I haven't just missed it in the documentation.
> The full paper is at http://epubs.siam.org/doi/abs/10.1137/0219009
> but seems to need a subscription unfortunately.
> Raphael
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

[Prev in Thread] Current Thread [Next in Thread]