Changeset 1081:f1398882a928 in lemon for test/euler_test.cc
- Timestamp:
- 08/08/11 12:36:16 (13 years ago)
- Branch:
- 1.1
- Phase:
- public
- Tags:
- r1.1.4
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/euler_test.cc
r639 r1081 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 095 * Copyright (C) 2003-2011 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 86 86 typedef ListDigraph Digraph; 87 87 typedef Undirector<Digraph> Graph; 88 89 { 90 Digraph d; 91 Graph g(d); 92 88 89 { 90 Digraph d; 91 Graph g(d); 92 93 93 checkDiEulerIt(d); 94 94 checkDiEulerIt(g); … … 129 129 Digraph::Node n2 = d.addNode(); 130 130 Digraph::Node n3 = d.addNode(); 131 131 132 132 d.addArc(n1, n2); 133 133 d.addArc(n2, n1); … … 154 154 Digraph::Node n5 = d.addNode(); 155 155 Digraph::Node n6 = d.addNode(); 156 156 157 157 d.addArc(n1, n2); 158 158 d.addArc(n2, n4); … … 190 190 Digraph::Node n4 = d.addNode(); 191 191 Digraph::Node n5 = d.addNode(); 192 192 193 193 d.addArc(n1, n2); 194 194 d.addArc(n2, n3); … … 212 212 Digraph::Node n2 = d.addNode(); 213 213 Digraph::Node n3 = d.addNode(); 214 214 215 215 d.addArc(n1, n2); 216 216 d.addArc(n2, n3);
Note: See TracChangeset
for help on using the changeset viewer.