Changeset 1172:c18ed26f016c in lemon for test/dfs_test.cc
- Timestamp:
- 11/28/12 11:42:38 (11 years ago)
- Branch:
- 1.1
- Parents:
- 1168:b78a46fe8002 (diff), 1171:7e368d9b67f7 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent. - Phase:
- public
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
test/dfs_test.cc
r1081 r1172 68 68 int l, i; 69 69 bool b; 70 ignore_unused_variable_warning(l,i,b); 71 70 72 DType::DistMap d(G); 71 73 DType::PredMap p(G); … … 152 154 Digraph g; 153 155 bool b; 156 ignore_unused_variable_warning(b); 157 154 158 dfs(g).run(Node()); 155 159 b=dfs(g).run(Node(),Node()); -
test/dfs_test.cc
r1171 r1172 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). … … 89 89 b = const_dfs_test.emptyQueue(); 90 90 i = const_dfs_test.queueSize(); 91 91 92 92 dfs_test.start(); 93 93 dfs_test.start(t); … … 115 115 concepts::ReadWriteMap<Node,bool> reached_map; 116 116 concepts::WriteMap<Node,bool> processed_map; 117 117 118 118 dfs_test 119 119 .predMap(pred_map) … … 132 132 b = dfs_test.emptyQueue(); 133 133 i = dfs_test.queueSize(); 134 134 135 135 dfs_test.start(); 136 136 dfs_test.start(t); … … 224 224 check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6."); 225 225 } 226 226 227 227 { 228 228 NullMap<Node,Arc> myPredMap;
Note: See TracChangeset
for help on using the changeset viewer.