Re: [jgrapht-users] StoerWagnerMinimumCut bugged?

[H.N. de R. <hnr...@gr...>]

On Thu, Nov 01, 2012 at 05:43:59PM +0100, Joris Kinable wrote:

> It seems that the StoerWagnerMinimumCut is bugged in jgrapht 0.8.3.
> Attached are two small code samples, both resulting in a runtime
> error.

I took a quick peek at the code of StoerWagnerMinimumCut and there are two
things wrong with it:
1) It accepts DirectedGraphs, although the algorithm only works for
undirected graphs.
2) The main loop runs while |V| > 2, instead of |V| > 1.

Is this issue still current, or did somebody already create a fix for it?

Regards,
   Ernst

-- 
Information System on Graph Classes and their Inclusions (ISGCI)
http://www.graphclasses.org