An additional simplier interface for static size graphs.
Node operator()(int) for getting node by index
int index(Node node) for getting index by node
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #include<lemon/refptr.h>
20 #include "test_tools.h"
27 Test(int &co) : _counter(co)
29 std::cerr << "Init\n";
34 std::cerr << "Destroy\n";
37 int &counter() { return _counter; }
46 RefPtr<Test> a = new Test(c);
47 check(a->counter() == 1, "Wrong number of initialization");
50 check((*b).counter() == 1, "Wrong number of initialization");
53 check((*a).counter() == 1, "Wrong number of initialization");
55 check(a->counter() == 1, "Wrong number of initialization");
57 check(c == 0, "Wrong number of initialization");