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-2011 |
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 |
2636 LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member"); |
2636 LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member"); |
2637 _use_nodes = true; |
2637 _use_nodes = true; |
2638 for (RedNodeIt n(_graph); n != INVALID; ++n) { |
2638 for (RedNodeIt n(_graph); n != INVALID; ++n) { |
2639 _red_node_index.insert(std::make_pair(converter(map[n]), n)); |
2639 _red_node_index.insert(std::make_pair(converter(map[n]), n)); |
2640 } |
2640 } |
2641 for (BlueNodeIt n(_graph); n != INVALID; ++n) { |
2641 for (BlueNodeIt n(_graph); n != INVALID; ++n) { |
2642 _blue_node_index.insert(std::make_pair(converter(map[n]), n)); |
2642 _blue_node_index.insert(std::make_pair(converter(map[n]), n)); |
2643 } |
2643 } |
2644 return *this; |
2644 return *this; |
2645 } |
2645 } |
2646 |
2646 |