Re: [igraph] mincut of directed graphs

[Stephen Dixon]

Thank you for you help.  Excuse my ignorance, but when looking at the builds for the 0.6 version the python-igraph builds seem much smaller than the other build.  Do I need to download the C library and build it and then build the python source?

 

On Sun, Dec 4, 2011 at 1:52 PM, Tamás Nepusz <address@hidden> wrote:

Dear Stephen,

If you are using igraph 0.5.x, then this is not possible at the moment; igraph 0.5.x contains the min-cut algorithm for undirected graphs only. igraph 0.6 will contain an implementation of the min-cut calculation for directed graphs as well, so if you are willing to put up with the bleeding-edge development version of igraph, try one of our nightly builds from here:

http://code.google.com/p/igraph/downloads/list

--
Tamas

On 4 Dec 2011, at 01:10, Stephen Dixon wrote:

> <Mail Attachment>_______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help


_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help