1.1 --- a/test/digraph_test.cc	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/test/digraph_test.cc	Sat Mar 06 14:35:12 2010 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2009
     1.8 + * Copyright (C) 2003-2010
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -392,9 +392,9 @@
    1.13    SmartDigraph g;
    1.14    SmartDigraph::NodeMap<StaticDigraph::Node> nref(g);
    1.15    SmartDigraph::ArcMap<StaticDigraph::Arc> aref(g);
    1.16 -  
    1.17 +
    1.18    StaticDigraph G;
    1.19 -  
    1.20 +
    1.21    checkGraphNodeList(G, 0);
    1.22    checkGraphArcList(G, 0);
    1.23  
    1.24 @@ -464,7 +464,7 @@
    1.25    arcs.push_back(std::make_pair(4,1));
    1.26  
    1.27    G.build(6, arcs.begin(), arcs.end());
    1.28 -  
    1.29 +
    1.30    checkGraphNodeList(G, 6);
    1.31    checkGraphArcList(G, 9);
    1.32  
    1.33 @@ -488,7 +488,7 @@
    1.34    checkArcIds(G);
    1.35    checkGraphNodeMap(G);
    1.36    checkGraphArcMap(G);
    1.37 -  
    1.38 +
    1.39    int n = G.nodeNum();
    1.40    int m = G.arcNum();
    1.41    check(G.index(G.node(n-1)) == n-1, "Wrong index.");