1.1 --- a/lemon/unionfind.h Sun Dec 21 20:47:15 2008 +0100
1.2 +++ b/lemon/unionfind.h Thu Jan 01 00:00:00 2009 +0100
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2008
1.8 + * Copyright (C) 2003-2009
1.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 *
1.12 @@ -1189,7 +1189,7 @@
1.13 int ld = nodes[nodes[jd].next].left;
1.14 popLeft(nodes[jd].next);
1.15 pushRight(jd, ld);
1.16 - if (less(ld, nodes[jd].left) ||
1.17 + if (less(ld, nodes[jd].left) ||
1.18 nodes[ld].item == nodes[pd].item) {
1.19 nodes[jd].item = nodes[ld].item;
1.20 nodes[jd].prio = nodes[ld].prio;