[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] minimum cut; undirected graph

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!


Gregory Benison
Oregon State University
gbenison at gmail dot com

reply via email to

[Prev in Thread] Current Thread [Next in Thread]