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 |
1232 _all_arc_num = f; |
1232 _all_arc_num = f; |
1233 } |
1233 } |
1234 |
1234 |
1235 return true; |
1235 return true; |
1236 } |
1236 } |
1237 |
1237 |
1238 // Check if the upper bound is greater or equal to the lower bound |
1238 // Check if the upper bound is greater or equal to the lower bound |
1239 // on each arc. |
1239 // on each arc. |
1240 bool checkBoundMaps() { |
1240 bool checkBoundMaps() { |
1241 for (int j = 0; j != _arc_num; ++j) { |
1241 for (int j = 0; j != _arc_num; ++j) { |
1242 if (_upper[j] < _lower[j]) return false; |
1242 if (_upper[j] < _lower[j]) return false; |