|
| From: | gregory benison |
| Subject: | Re: [igraph] minimum cut; undirected graph |
| Date: | Sun, 1 Apr 2007 11:18:22 -0700 |
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! Greg ====================== Gregory Benison Oregon State University (541)-737-1876 gbenison at gmail dot com ======================
| [Prev in Thread] | Current Thread | [Next in Thread] |