|
From: | 王光辉 |
Subject: | RE: [igraph] mincut |
Date: | Wed, 13 May 2009 16:24:07 +0800 |
Gabor, thanks. In fact, I want to get the Gomory-hu tree. I hope that you can do it. Thank you again! best guanghui > Date: Wed, 13 May 2009 10:17:24 +0200 > Subject: Re: [igraph] mincut > From: address@hidden > To: address@hidden > > Guanghui, no, not currently. This has been an issue for a while, I > would just need a free day or two to do it. Not in the near future, > unfortunately. You can follow the issue here: > https://bugs.launchpad.net/igraph/+bug/291196 > > Best, > G. > > 2009/5/13 王光辉 <address@hidden>: > > Hi Gabor, > > > > I use the command graph.mincut to compute the min cut between nodes s and t. > > Is it possible that we can get the set of nodes on the s side of the cut? > > Thank you in advance! > > > > best > > > > guanghui > > > > > > > > > > > > > > > > ________________________________ > > 更多热辣资讯尽在新版MSN首页! 立刻访问! > > _______________________________________________ > > igraph-help mailing list > > address@hidden > > http://lists.nongnu.org/mailman/listinfo/igraph-help > > > > > > > > -- > Gabor Csardi <address@hidden> UNIL DGM > > > _______________________________________________ > igraph-help mailing list > address@hidden > http://lists.nongnu.org/mailman/listinfo/igraph-help 立即试试微软地图新功能,msn互动浏览! 立刻体验! |
[Prev in Thread] | Current Thread | [Next in Thread] |