
From:  Vincent Matossian 
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!
Greg
======================
Gregory Benison
Oregon State University
(541)7371876
gbenison at gmail dot com
======================
_______________________________________________
igraphhelp mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraphhelp
[Prev in Thread]  Current Thread  [Next in Thread] 