1.1 --- a/test/suurballe_test.cc	Tue Oct 28 18:39:53 2008 +0000
     1.2 +++ b/test/suurballe_test.cc	Tue Oct 28 23:10:27 2008 +0100
     1.3 @@ -28,7 +28,7 @@
     1.4  
     1.5  using namespace lemon;
     1.6  
     1.7 -// Checks the feasibility of the flow
     1.8 +// Check the feasibility of the flow
     1.9  template <typename Digraph, typename FlowMap>
    1.10  bool checkFlow( const Digraph& gr, const FlowMap& flow, 
    1.11                  typename Digraph::Node s, typename Digraph::Node t,
    1.12 @@ -52,13 +52,13 @@
    1.13    return true;
    1.14  }
    1.15  
    1.16 -// Checks the optimalitiy of the flow
    1.17 +// Check the optimalitiy of the flow
    1.18  template < typename Digraph, typename CostMap, 
    1.19             typename FlowMap, typename PotentialMap >
    1.20  bool checkOptimality( const Digraph& gr, const CostMap& cost,
    1.21                        const FlowMap& flow, const PotentialMap& pi )
    1.22  {
    1.23 -  // Checking the Complementary Slackness optimality condition
    1.24 +  // Check the "Complementary Slackness" optimality condition
    1.25    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
    1.26    bool opt = true;
    1.27    for (ArcIt e(gr); e != INVALID; ++e) {
    1.28 @@ -71,12 +71,12 @@
    1.29    return opt;
    1.30  }
    1.31  
    1.32 -// Checks a path
    1.33 -template < typename Digraph, typename Path >
    1.34 +// Check a path
    1.35 +template <typename Digraph, typename Path>
    1.36  bool checkPath( const Digraph& gr, const Path& path,
    1.37                  typename Digraph::Node s, typename Digraph::Node t)
    1.38  {
    1.39 -  // Checking the Complementary Slackness optimality condition
    1.40 +  // Check the "Complementary Slackness" optimality condition
    1.41    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
    1.42    Node n = s;
    1.43    for (int i = 0; i < path.length(); ++i) {
    1.44 @@ -91,7 +91,7 @@
    1.45  {
    1.46    DIGRAPH_TYPEDEFS(ListDigraph);
    1.47  
    1.48 -  // Reading the test digraph
    1.49 +  // Read the test digraph
    1.50    ListDigraph digraph;
    1.51    ListDigraph::ArcMap<int> length(digraph);
    1.52    Node source, target;
    1.53 @@ -111,7 +111,7 @@
    1.54      run();
    1.55    input.close();
    1.56    
    1.57 -  // Finding 2 paths
    1.58 +  // Find 2 paths
    1.59    {
    1.60      Suurballe<ListDigraph> suurballe(digraph, length, source, target);
    1.61      check(suurballe.run(2) == 2, "Wrong number of paths");
    1.62 @@ -126,7 +126,7 @@
    1.63              "Wrong path");
    1.64    }
    1.65  
    1.66 -  // Finding 3 paths
    1.67 +  // Find 3 paths
    1.68    {
    1.69      Suurballe<ListDigraph> suurballe(digraph, length, source, target);
    1.70      check(suurballe.run(3) == 3, "Wrong number of paths");
    1.71 @@ -141,7 +141,7 @@
    1.72              "Wrong path");
    1.73    }
    1.74  
    1.75 -  // Finding 5 paths (only 3 can be found)
    1.76 +  // Find 5 paths (only 3 can be found)
    1.77    {
    1.78      Suurballe<ListDigraph> suurballe(digraph, length, source, target);
    1.79      check(suurballe.run(5) == 3, "Wrong number of paths");