439 checkGraphInArcList(G, nref[n2], 1); |
439 checkGraphInArcList(G, nref[n2], 1); |
440 checkGraphInArcList(G, nref[n3], 2); |
440 checkGraphInArcList(G, nref[n3], 2); |
441 |
441 |
442 checkGraphConArcList(G, 4); |
442 checkGraphConArcList(G, 4); |
443 |
443 |
|
444 std::vector<std::pair<int,int> > arcs; |
|
445 arcs.push_back(std::make_pair(0,1)); |
|
446 arcs.push_back(std::make_pair(0,2)); |
|
447 arcs.push_back(std::make_pair(1,3)); |
|
448 arcs.push_back(std::make_pair(1,2)); |
|
449 arcs.push_back(std::make_pair(3,0)); |
|
450 arcs.push_back(std::make_pair(3,3)); |
|
451 arcs.push_back(std::make_pair(4,2)); |
|
452 arcs.push_back(std::make_pair(4,3)); |
|
453 arcs.push_back(std::make_pair(4,1)); |
|
454 |
|
455 G.build(6, arcs.begin(), arcs.end()); |
|
456 |
|
457 checkGraphNodeList(G, 6); |
|
458 checkGraphArcList(G, 9); |
|
459 |
|
460 checkGraphOutArcList(G, G.node(0), 2); |
|
461 checkGraphOutArcList(G, G.node(1), 2); |
|
462 checkGraphOutArcList(G, G.node(2), 0); |
|
463 checkGraphOutArcList(G, G.node(3), 2); |
|
464 checkGraphOutArcList(G, G.node(4), 3); |
|
465 checkGraphOutArcList(G, G.node(5), 0); |
|
466 |
|
467 checkGraphInArcList(G, G.node(0), 1); |
|
468 checkGraphInArcList(G, G.node(1), 2); |
|
469 checkGraphInArcList(G, G.node(2), 3); |
|
470 checkGraphInArcList(G, G.node(3), 3); |
|
471 checkGraphInArcList(G, G.node(4), 0); |
|
472 checkGraphInArcList(G, G.node(5), 0); |
|
473 |
|
474 checkGraphConArcList(G, 9); |
|
475 |
444 checkNodeIds(G); |
476 checkNodeIds(G); |
445 checkArcIds(G); |
477 checkArcIds(G); |
446 checkGraphNodeMap(G); |
478 checkGraphNodeMap(G); |
447 checkGraphArcMap(G); |
479 checkGraphArcMap(G); |
448 |
480 |