[Lemon-devel] Hao-Orlin doc

[Balázs Dezső]

It updates the same map in both phases, so it overwrites the previous
result, if a better cut is found in the second phase.

Balazs

On Mon, Nov 15, 2010 at 7:25 AM, Alpár Jüttner <alpar at cs.elte.hu> wrote:
> One more question about HaoOrlin.
>
> How do calculateIn() and calculateOut() work? Do they update the min cut
> if they find a better than the actual one or both cuts are stored
> separately?
>
> Alpar
>
>
> On Mon, 2010-11-15 at 07:06 +0000, Balázs Dezső wrote:
>> Hi,
>>
>> In the first implementation of the Hao-Orlin algorithm (SVN r2937),
>> the first target node was also a parameter. It's not the case with the
>> newer implementations, but the documentation is not updated properly.
>>
>> Regards, Balazs
>>
>>
>>
>> On Mon, Nov 15, 2010 at 6:51 AM, Alpár Jüttner <alpar at cs.elte.hu> wrote:
>> > Hi,
>> >
>> > What does the following comment mean at HaoOrlin::run(const Node &s) at
>> > http://lemon.cs.elte.hu/pub/doc/1.2.1/a00162.html
>> > ?
>> >
>> >        "It uses the given source node, finds a proper target node and
>> >        then calls [...]"
>> >
>> > The problem description does not refer to any kind of ''target'' node.
>> >
>> >
>> > Regards,
>> > Alpar
>> >
>> >
>> > _______________________________________________
>> > Lemon-devel mailing list
>> > Lemon-devel at lemon.cs.elte.hu
>> > http://lemon.cs.elte.hu/mailman/listinfo/lemon-devel
>> >
>
>
>