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 |
1763 node.id = first_blue; |
1763 node.id = first_blue; |
1764 } |
1764 } |
1765 |
1765 |
1766 void next(BlueNode& node) const { |
1766 void next(BlueNode& node) const { |
1767 node.id = nodes[node.id].partition_next; |
1767 node.id = nodes[node.id].partition_next; |
1768 } |
1768 } |
1769 |
1769 |
1770 void first(Arc& e) const { |
1770 void first(Arc& e) const { |
1771 int n = first_node; |
1771 int n = first_node; |
1772 while (n != -1 && nodes[n].first_out == -1) { |
1772 while (n != -1 && nodes[n].first_out == -1) { |
1773 n = nodes[n].next; |
1773 n = nodes[n].next; |