Changeset 1025:c8fa41fcc4a7 in lemon-main for test/bpgraph_test.cc
- Timestamp:
- 12/01/11 09:05:47 (13 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
test/bpgraph_test.cc
r1021 r1025 42 42 G.reserveEdge(3); 43 43 44 Node44 RedNode 45 45 rn1 = G.addRedNode(); 46 46 checkGraphNodeList(G, 1); … … 50 50 checkGraphArcList(G, 0); 51 51 52 Node52 BlueNode 53 53 bn1 = G.addBlueNode(), 54 54 bn2 = G.addBlueNode(); … … 77 77 78 78 Edge 79 e2 = G.addEdge( rn1, bn1),79 e2 = G.addEdge(bn1, rn1), 80 80 e3 = G.addEdge(rn1, bn2); 81 81 … … 113 113 114 114 BpGraph G; 115 Node 116 n1 = G.addRedNode(), n2 = G.addBlueNode(), 117 n3 = G.addBlueNode(), n4 = G.addRedNode(); 115 RedNode 116 n1 = G.addRedNode(), n4 = G.addRedNode(); 117 BlueNode 118 n2 = G.addBlueNode(), n3 = G.addBlueNode(); 118 119 Edge 119 120 e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3), … … 160 161 161 162 BpGraph G; 162 Node 163 n1 = G.addRedNode(), n2 = G.addBlueNode(), 164 n3 = G.addBlueNode(), n4 = G.addRedNode(); 163 RedNode 164 n1 = G.addRedNode(), n4 = G.addRedNode(); 165 BlueNode 166 n2 = G.addBlueNode(), n3 = G.addBlueNode(); 165 167 Edge 166 168 e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3), … … 210 212 211 213 BpGraph G; 212 Node 213 n1 = G.addRedNode(), 214 RedNode 215 n1 = G.addRedNode(); 216 BlueNode 214 217 n2 = G.addBlueNode(), 215 218 n3 = G.addBlueNode(); … … 226 229 typename BpGraph::Snapshot snapshot(G); 227 230 228 Node n4 = G.addRedNode();231 RedNode n4 = G.addRedNode(); 229 232 G.addEdge(n4, n2); 230 233 G.addEdge(n4, n3); … … 293 296 BpGraph g; 294 297 295 Node 296 n1 = g.addRedNode(), 298 RedNode 299 n1 = g.addRedNode(); 300 BlueNode 297 301 n2 = g.addBlueNode(), 298 302 n3 = g.addBlueNode(); … … 397 401 for (int i = 0; i < G.redNum(); ++i) { 398 402 check(G.red(G.redNode(i)), "Wrong node"); 399 check(G. redIndex(G.redNode(i)) == i, "Wrong index");403 check(G.index(G.redNode(i)) == i, "Wrong index"); 400 404 } 401 405 402 406 for (int i = 0; i < G.blueNum(); ++i) { 403 407 check(G.blue(G.blueNode(i)), "Wrong node"); 404 check(G. blueIndex(G.blueNode(i)) == i, "Wrong index");408 check(G.index(G.blueNode(i)) == i, "Wrong index"); 405 409 } 406 410
Note: See TracChangeset
for help on using the changeset viewer.