1.1 --- a/test/max_flow_test.cc	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/test/max_flow_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-2010
     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 @@ -222,7 +222,7 @@
    1.13  void initFlowTest()
    1.14  {
    1.15    DIGRAPH_TYPEDEFS(SmartDigraph);
    1.16 -  
    1.17 +
    1.18    SmartDigraph g;
    1.19    SmartDigraph::ArcMap<int> cap(g),iflow(g);
    1.20    Node s=g.addNode(); Node t=g.addNode();
    1.21 @@ -382,7 +382,7 @@
    1.22    checkMaxFlowAlg<PType1, PreflowStartFunctions<PType1> >();
    1.23    checkMaxFlowAlg<PType2, PreflowStartFunctions<PType2> >();
    1.24    initFlowTest();
    1.25 -  
    1.26 +
    1.27    // Check EdmondsKarp
    1.28    typedef EdmondsKarp<SmartDigraph, SmartDigraph::ArcMap<int> > EKType1;
    1.29    typedef EdmondsKarp<SmartDigraph, SmartDigraph::ArcMap<float> > EKType2;
    1.30 @@ -390,6 +390,6 @@
    1.31    checkMaxFlowAlg<EKType2, GeneralStartFunctions<EKType2> >();
    1.32  
    1.33    initFlowTest();
    1.34 -  
    1.35 +
    1.36    return 0;
    1.37  }