[Lemon-user] Min cut algorithms

[Balázs Dezső]

Nagamochi-Ibaraki algorithm supports step-by-step execution, so you need to
call init() and processNextPhase() while the cut value decrease below your
limit. Hao-Orlin doesn't support this feature yet, but it looks to be
possible to extend the algorithm.

Balazs


On Thu, Mar 21, 2013 at 10:48 AM, Attila Bernáth <bernath.athos at gmail.com>wrote:

> Dear Developers,
>
> I would like to use Hao-Orlin an Nagamochi-Ibaraki algorithm in the
> following sense:
> I only want to check whether the min cut is smaller than a certain value
> m. So I would like to stop when any cut of value less than m is found. Can
> this be done somehow?
>
> Thanks in advance!
>
> Attila
>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20130321/bd115f7a/attachment.html>