equal
deleted
inserted
replaced
1 /* -*- mode: C++; indent-tabs-mode: nil; -*- |
1 /* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 * |
2 * |
3 * This file is a part of LEMON, a generic C++ optimization library. |
3 * This file is a part of LEMON, a generic C++ optimization library. |
4 * |
4 * |
5 * Copyright (C) 2003-2010 |
5 * Copyright (C) 2003-2013 |
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 * |
8 * |
9 * Permission to use, modify and distribute this software is granted |
9 * Permission to use, modify and distribute this software is granted |
10 * provided that this copyright notice appears in all copies. For |
10 * provided that this copyright notice appears in all copies. For |
1261 if (first_red != -1) { |
1261 if (first_red != -1) { |
1262 max_red = nodes[first_red].partition_index; |
1262 max_red = nodes[first_red].partition_index; |
1263 } else { |
1263 } else { |
1264 max_red = -1; |
1264 max_red = -1; |
1265 } |
1265 } |
1266 Parent::notifier(RedNode()).erase(asRedNodeUnsafe(node)); |
1266 Parent::notifier(RedNode()).erase(asRedNodeUnsafe(node)); |
1267 } else { |
1267 } else { |
1268 first_blue = nodes[n].partition_next; |
1268 first_blue = nodes[n].partition_next; |
1269 if (first_blue != -1) { |
1269 if (first_blue != -1) { |
1270 max_blue = nodes[first_blue].partition_index; |
1270 max_blue = nodes[first_blue].partition_index; |
1271 } else { |
1271 } else { |