test/graph_copy_test.cc
changeset 1270 dceba191c00d
parent 1194 699c7eac2c6d
     1.1 --- a/test/graph_copy_test.cc	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/test/graph_copy_test.cc	Fri Aug 09 11:28:17 2013 +0200
     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-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -53,7 +53,7 @@
    1.13        if (i == 0 && j == 0) fa = arc;
    1.14      }
    1.15    }
    1.16 -  
    1.17 +
    1.18    // Test digraph copy
    1.19    GR to;
    1.20    typename GR::template NodeMap<int> tnm(to);
    1.21 @@ -72,7 +72,7 @@
    1.22      nodeRef(nr).arcRef(er).
    1.23      nodeCrossRef(ncr).arcCrossRef(ecr).
    1.24      node(fn, tn).arc(fa, ta).run();
    1.25 -  
    1.26 +
    1.27    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.28    check(countArcs(from) == countArcs(to), "Wrong copy.");
    1.29  
    1.30 @@ -100,7 +100,7 @@
    1.31  
    1.32    // Test repeated copy
    1.33    digraphCopy(from, to).run();
    1.34 -  
    1.35 +
    1.36    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.37    check(countArcs(from) == countArcs(to), "Wrong copy.");
    1.38  }
    1.39 @@ -203,7 +203,7 @@
    1.40  
    1.41    // Test repeated copy
    1.42    graphCopy(from, to).run();
    1.43 -  
    1.44 +
    1.45    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.46    check(countEdges(from) == countEdges(to), "Wrong copy.");
    1.47    check(countArcs(from) == countArcs(to), "Wrong copy.");
    1.48 @@ -366,7 +366,7 @@
    1.49  
    1.50    // Test repeated copy
    1.51    bpGraphCopy(from, to).run();
    1.52 -  
    1.53 +
    1.54    check(countNodes(from) == countNodes(to), "Wrong copy.");
    1.55    check(countRedNodes(from) == countRedNodes(to), "Wrong copy.");
    1.56    check(countBlueNodes(from) == countBlueNodes(to), "Wrong copy.");