1.1 --- a/test/graph_adaptor_test.cc	Sun Dec 21 20:47:15 2008 +0100
     1.2 +++ b/test/graph_adaptor_test.cc	Thu Jan 01 00:00:00 2009 +0100
     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-2008
     1.8 + * Copyright (C) 2003-2009
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -103,7 +103,7 @@
    1.13  
    1.14    node_filter[n1] = node_filter[n2] = node_filter[n3] = true;
    1.15    arc_filter[a1] = arc_filter[a2] = arc_filter[a3] = true;
    1.16 -  
    1.17 +
    1.18    checkGraphNodeList(adaptor, 3);
    1.19    checkGraphArcList(adaptor, 3);
    1.20    checkGraphConArcList(adaptor, 3);
    1.21 @@ -196,7 +196,7 @@
    1.22    Digraph::Arc a3 = digraph.addArc(n2, n3);
    1.23  
    1.24    node_filter[n1] = node_filter[n2] = node_filter[n3] = true;
    1.25 -  
    1.26 +
    1.27    checkGraphNodeList(adaptor, 3);
    1.28    checkGraphArcList(adaptor, 3);
    1.29    checkGraphConArcList(adaptor, 3);
    1.30 @@ -268,7 +268,7 @@
    1.31    Digraph::Arc a3 = digraph.addArc(n2, n3);
    1.32  
    1.33    arc_filter[a1] = arc_filter[a2] = arc_filter[a3] = true;
    1.34 -  
    1.35 +
    1.36    checkGraphNodeList(adaptor, 3);
    1.37    checkGraphArcList(adaptor, 3);
    1.38    checkGraphConArcList(adaptor, 3);
    1.39 @@ -577,7 +577,7 @@
    1.40  
    1.41    node_filter[n1] = node_filter[n2] = node_filter[n3] = node_filter[n4] = true;
    1.42    edge_filter[e1] = edge_filter[e2] = edge_filter[e3] = edge_filter[e4] = true;
    1.43 -  
    1.44 +
    1.45    checkGraphNodeList(adaptor, 4);
    1.46    checkGraphArcList(adaptor, 8);
    1.47    checkGraphEdgeList(adaptor, 4);
    1.48 @@ -708,7 +708,7 @@
    1.49    Graph::Edge e4 = graph.addEdge(n3, n4);
    1.50  
    1.51    node_filter[n1] = node_filter[n2] = node_filter[n3] = node_filter[n4] = true;
    1.52 -  
    1.53 +
    1.54    checkGraphNodeList(adaptor, 4);
    1.55    checkGraphArcList(adaptor, 8);
    1.56    checkGraphEdgeList(adaptor, 4);
    1.57 @@ -807,7 +807,7 @@
    1.58    Graph::Edge e4 = graph.addEdge(n3, n4);
    1.59  
    1.60    edge_filter[e1] = edge_filter[e2] = edge_filter[e3] = edge_filter[e4] = true;
    1.61 -  
    1.62 +
    1.63    checkGraphNodeList(adaptor, 4);
    1.64    checkGraphArcList(adaptor, 8);
    1.65    checkGraphEdgeList(adaptor, 4);