Changeset 346:7f26c4b32651 in lemon-main for test

Timestamp:

10/28/08 23:10:27 (16 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Minor doc improvements related to Suurballe (#47)

File:

• test/suurballe_test.cc (modified) (8 diffs)

test/suurballe_test.cc

@@ -29 +29 @@
 using namespace lemon;
 
-// Checks the feasibility of the flow
+// Check the feasibility of the flow
 template <typename Digraph, typename FlowMap>
 bool checkFlow( const Digraph& gr, const FlowMap& flow, 
@@ -53 +53 @@
 }
 
-// Checks the optimalitiy of the flow
+// Check the optimalitiy of the flow
 template < typename Digraph, typename CostMap, 
            typename FlowMap, typename PotentialMap >
@@ -59 +59 @@
                       const FlowMap& flow, const PotentialMap& pi )
 {
-  // Checking the Complementary Slackness optimality condition
+  // Check the "Complementary Slackness" optimality condition
   TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
   bool opt = true;
@@ -72 +72 @@
 }
 
-// Checks a path
-template < typename Digraph, typename Path >
+// Check a path
+template <typename Digraph, typename Path>
 bool checkPath( const Digraph& gr, const Path& path,
                 typename Digraph::Node s, typename Digraph::Node t)
 {
-  // Checking the Complementary Slackness optimality condition
+  // Check the "Complementary Slackness" optimality condition
   TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
   Node n = s;
@@ -92 +92 @@
   DIGRAPH_TYPEDEFS(ListDigraph);
 
-  // Reading the test digraph
+  // Read the test digraph
   ListDigraph digraph;
   ListDigraph::ArcMap<int> length(digraph);
@@ -112 +112 @@
   input.close();
   
-  // Finding 2 paths
+  // Find 2 paths
   {
     Suurballe<ListDigraph> suurballe(digraph, length, source, target);
@@ -127 +127 @@
   }
 
-  // Finding 3 paths
+  // Find 3 paths
   {
     Suurballe<ListDigraph> suurballe(digraph, length, source, target);
@@ -142 +142 @@
   }
 
-  // Finding 5 paths (only 3 can be found)
+  // Find 5 paths (only 3 can be found)
   {
     Suurballe<ListDigraph> suurballe(digraph, length, source, target);