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 |
100 { |
100 { |
101 Digraph d; |
101 Digraph d; |
102 Graph g(d); |
102 Graph g(d); |
103 Digraph::Node n = d.addNode(); |
103 Digraph::Node n = d.addNode(); |
104 ::lemon::ignore_unused_variable_warning(n); |
104 ::lemon::ignore_unused_variable_warning(n); |
105 |
105 |
106 checkDiEulerIt(d); |
106 checkDiEulerIt(d); |
107 checkDiEulerIt(g); |
107 checkDiEulerIt(g); |
108 checkEulerIt(g); |
108 checkEulerIt(g); |
109 |
109 |
110 check(eulerian(d), "This graph is Eulerian"); |
110 check(eulerian(d), "This graph is Eulerian"); |