|Subject:||Re: [igraph] minimum cut; undirected graph in R|
|Date:||Sat, 18 Aug 2007 15:57:04 -0400|
> partition and partition2 are the vertex ids of the two partitions
> and cut contains the edge ids of the edges in the cut. These are only
> calculated if they're not NULL, so it is possible to calculate 'cut' only.
> (Of course this function does not (yet) work for directed graphs.)
> Is this ok?
Yes, that's great - thanks for putting it in!
Oregon State University
gbenison at gmail dot com
igraph-help mailing list
|[Prev in Thread]||Current Thread||[Next in Thread]|