test/digraph_test.cc
changeset 827 580af8cf2f6a
parent 824 5764dd9b6e18
parent 787 819ca5b50de0
child 956 141f9c0db4a3
     1.1 --- a/test/digraph_test.cc	Thu Nov 05 10:01:02 2009 +0100
     1.2 +++ b/test/digraph_test.cc	Thu Nov 05 10:23:16 2009 +0100
     1.3 @@ -36,6 +36,9 @@
     1.4    checkGraphNodeList(G, 0);
     1.5    checkGraphArcList(G, 0);
     1.6  
     1.7 +  G.reserveNode(3);
     1.8 +  G.reserveArc(4);
     1.9 +
    1.10    Node
    1.11      n1 = G.addNode(),
    1.12      n2 = G.addNode(),
    1.13 @@ -284,6 +287,14 @@
    1.14    G.addArc(G.addNode(), G.addNode());
    1.15  
    1.16    snapshot.restore();
    1.17 +  snapshot.save(G);
    1.18 +
    1.19 +  checkGraphNodeList(G, 4);
    1.20 +  checkGraphArcList(G, 4);
    1.21 +
    1.22 +  G.addArc(G.addNode(), G.addNode());
    1.23 +
    1.24 +  snapshot.restore();
    1.25  
    1.26    checkGraphNodeList(G, 4);
    1.27    checkGraphArcList(G, 4);
    1.28 @@ -487,7 +498,12 @@
    1.29  void checkFullDigraph(int num) {
    1.30    typedef FullDigraph Digraph;
    1.31    DIGRAPH_TYPEDEFS(Digraph);
    1.32 +
    1.33    Digraph G(num);
    1.34 +  check(G.nodeNum() == num && G.arcNum() == num * num, "Wrong size");
    1.35 +
    1.36 +  G.resize(num);
    1.37 +  check(G.nodeNum() == num && G.arcNum() == num * num, "Wrong size");
    1.38  
    1.39    checkGraphNodeList(G, num);
    1.40    checkGraphArcList(G, num * num);