Changeset 1092:dceba191c00d in lemon-main for test/graph_copy_test.cc
- Timestamp:
- 08/09/13 11:28:17 (11 years ago)
- Branch:
- default
- Children:
- 1093:fb1c7da561ce, 1165:e0ccc1f0268f
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/graph_copy_test.cc
r1026 r1092 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-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 54 54 } 55 55 } 56 56 57 57 // Test digraph copy 58 58 GR to; … … 73 73 nodeCrossRef(ncr).arcCrossRef(ecr). 74 74 node(fn, tn).arc(fa, ta).run(); 75 75 76 76 check(countNodes(from) == countNodes(to), "Wrong copy."); 77 77 check(countArcs(from) == countArcs(to), "Wrong copy."); … … 101 101 // Test repeated copy 102 102 digraphCopy(from, to).run(); 103 103 104 104 check(countNodes(from) == countNodes(to), "Wrong copy."); 105 105 check(countArcs(from) == countArcs(to), "Wrong copy."); … … 204 204 // Test repeated copy 205 205 graphCopy(from, to).run(); 206 206 207 207 check(countNodes(from) == countNodes(to), "Wrong copy."); 208 208 check(countEdges(from) == countEdges(to), "Wrong copy."); … … 367 367 // Test repeated copy 368 368 bpGraphCopy(from, to).run(); 369 369 370 370 check(countNodes(from) == countNodes(to), "Wrong copy."); 371 371 check(countRedNodes(from) == countRedNodes(to), "Wrong copy.");
Note: See TracChangeset
for help on using the changeset viewer.