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 |
902 _bucket_prev.resize(_res_node_num + 1); |
902 _bucket_prev.resize(_res_node_num + 1); |
903 _rank.resize(_res_node_num + 1); |
903 _rank.resize(_res_node_num + 1); |
904 |
904 |
905 return OPTIMAL; |
905 return OPTIMAL; |
906 } |
906 } |
907 |
907 |
908 // Check if the upper bound is greater or equal to the lower bound |
908 // Check if the upper bound is greater or equal to the lower bound |
909 // on each arc. |
909 // on each arc. |
910 bool checkBoundMaps() { |
910 bool checkBoundMaps() { |
911 for (int j = 0; j != _res_arc_num; ++j) { |
911 for (int j = 0; j != _res_arc_num; ++j) { |
912 if (_upper[j] < _lower[j]) return false; |
912 if (_upper[j] < _lower[j]) return false; |