[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] mincut of directed graphs
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] mincut of directed graphs |
Date: |
Sun, 4 Dec 2011 21:52:01 +0100 |
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] mincut of directed graphs, Stephen Dixon, 2011/12/04
- Re: [igraph] mincut of directed graphs,
Tamás Nepusz <=
- Re: [igraph] mincut of directed graphs, Stephen Dixon, 2011/12/05
- Re: [igraph] mincut of directed graphs, Tamas Nepusz, 2011/12/05
- Re: [igraph] mincut of directed graphs, Stephen Dixon, 2011/12/05
- Re: [igraph] mincut of directed graphs, Tamás Nepusz, 2011/12/05
- Re: [igraph] mincut of directed graphs, Stephen Dixon, 2011/12/05
- Re: [igraph] mincut of directed graphs, Tamás Nepusz, 2011/12/05