1.1 --- a/test/min_cost_arborescence_test.cc	Fri Aug 09 11:07:27 2013 +0200
     1.2 +++ b/test/min_cost_arborescence_test.cc	Sun Aug 11 15:28:12 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-2008
     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 @@ -111,7 +111,7 @@
    1.13    n = mcarb_test.processNextNode();
    1.14    b = const_mcarb_test.emptyQueue();
    1.15    i = const_mcarb_test.queueSize();
    1.16 -  
    1.17 +
    1.18    c = const_mcarb_test.arborescenceCost();
    1.19    b = const_mcarb_test.arborescence(e);
    1.20    e = const_mcarb_test.pred(n);
    1.21 @@ -121,12 +121,12 @@
    1.22      const_mcarb_test.predMap();
    1.23    b = const_mcarb_test.reached(n);
    1.24    b = const_mcarb_test.processed(n);
    1.25 -  
    1.26 +
    1.27    i = const_mcarb_test.dualNum();
    1.28    c = const_mcarb_test.dualValue();
    1.29    i = const_mcarb_test.dualSize(i);
    1.30    c = const_mcarb_test.dualValue(i);
    1.31 -  
    1.32 +
    1.33    ::lemon::ignore_unused_variable_warning(am);
    1.34    ::lemon::ignore_unused_variable_warning(pm);
    1.35  }