1.1 --- a/test/digraph_test.cc	Tue Sep 29 13:03:34 2009 +0200
     1.2 +++ b/test/digraph_test.cc	Thu Nov 05 10:01:02 2009 +0100
     1.3 @@ -441,6 +441,38 @@
     1.4  
     1.5    checkGraphConArcList(G, 4);
     1.6  
     1.7 +  std::vector<std::pair<int,int> > arcs;
     1.8 +  arcs.push_back(std::make_pair(0,1));
     1.9 +  arcs.push_back(std::make_pair(0,2));
    1.10 +  arcs.push_back(std::make_pair(1,3));
    1.11 +  arcs.push_back(std::make_pair(1,2));
    1.12 +  arcs.push_back(std::make_pair(3,0));
    1.13 +  arcs.push_back(std::make_pair(3,3));
    1.14 +  arcs.push_back(std::make_pair(4,2));
    1.15 +  arcs.push_back(std::make_pair(4,3));
    1.16 +  arcs.push_back(std::make_pair(4,1));
    1.17 +
    1.18 +  G.build(6, arcs.begin(), arcs.end());
    1.19 +  
    1.20 +  checkGraphNodeList(G, 6);
    1.21 +  checkGraphArcList(G, 9);
    1.22 +
    1.23 +  checkGraphOutArcList(G, G.node(0), 2);
    1.24 +  checkGraphOutArcList(G, G.node(1), 2);
    1.25 +  checkGraphOutArcList(G, G.node(2), 0);
    1.26 +  checkGraphOutArcList(G, G.node(3), 2);
    1.27 +  checkGraphOutArcList(G, G.node(4), 3);
    1.28 +  checkGraphOutArcList(G, G.node(5), 0);
    1.29 +
    1.30 +  checkGraphInArcList(G, G.node(0), 1);
    1.31 +  checkGraphInArcList(G, G.node(1), 2);
    1.32 +  checkGraphInArcList(G, G.node(2), 3);
    1.33 +  checkGraphInArcList(G, G.node(3), 3);
    1.34 +  checkGraphInArcList(G, G.node(4), 0);
    1.35 +  checkGraphInArcList(G, G.node(5), 0);
    1.36 +
    1.37 +  checkGraphConArcList(G, 9);
    1.38 +
    1.39    checkNodeIds(G);
    1.40    checkArcIds(G);
    1.41    checkGraphNodeMap(G);