[igraph] Gomory-Hu (python)

[Raphael C]

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