test/matching_test.cc
branch1.1
changeset 1081 f1398882a928
parent 641 d657c71db7db
child 1172 c18ed26f016c
     1.1 --- a/test/matching_test.cc	Fri Aug 05 09:33:42 2011 +0200
     1.2 +++ b/test/matching_test.cc	Mon Aug 08 12:36:16 2011 +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-2011
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -134,7 +134,7 @@
    1.13    mat_test.startSparse();
    1.14    mat_test.startDense();
    1.15    mat_test.run();
    1.16 -  
    1.17 +
    1.18    const_mat_test.matchingSize();
    1.19    const_mat_test.matching(e);
    1.20    const_mat_test.matching(n);
    1.21 @@ -143,7 +143,7 @@
    1.22    e = mmap[n];
    1.23    const_mat_test.mate(n);
    1.24  
    1.25 -  MaxMatching<Graph>::Status stat = 
    1.26 +  MaxMatching<Graph>::Status stat =
    1.27      const_mat_test.status(n);
    1.28    const MaxMatching<Graph>::StatusMap& smap =
    1.29      const_mat_test.statusMap();
    1.30 @@ -170,7 +170,7 @@
    1.31    mat_test.init();
    1.32    mat_test.start();
    1.33    mat_test.run();
    1.34 -  
    1.35 +
    1.36    const_mat_test.matchingWeight();
    1.37    const_mat_test.matchingSize();
    1.38    const_mat_test.matching(e);
    1.39 @@ -179,7 +179,7 @@
    1.40      const_mat_test.matchingMap();
    1.41    e = mmap[n];
    1.42    const_mat_test.mate(n);
    1.43 -  
    1.44 +
    1.45    int k = 0;
    1.46    const_mat_test.dualValue();
    1.47    const_mat_test.nodeValue(n);
    1.48 @@ -207,7 +207,7 @@
    1.49    mat_test.init();
    1.50    mat_test.start();
    1.51    mat_test.run();
    1.52 -  
    1.53 +
    1.54    const_mat_test.matchingWeight();
    1.55    const_mat_test.matching(e);
    1.56    const_mat_test.matching(n);
    1.57 @@ -215,7 +215,7 @@
    1.58      const_mat_test.matchingMap();
    1.59    e = mmap[n];
    1.60    const_mat_test.mate(n);
    1.61 -  
    1.62 +
    1.63    int k = 0;
    1.64    const_mat_test.dualValue();
    1.65    const_mat_test.nodeValue(n);