COIN-OR::LEMON - Graph Library

Changeset 346:7f26c4b32651 in lemon-main for test


Ignore:
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:
1 edited

Legend:

Unmodified
Added
Removed
  • test/suurballe_test.cc

    r345 r346  
    2929using namespace lemon;
    3030
    31 // Checks the feasibility of the flow
     31// Check the feasibility of the flow
    3232template <typename Digraph, typename FlowMap>
    3333bool checkFlow( const Digraph& gr, const FlowMap& flow,
     
    5353}
    5454
    55 // Checks the optimalitiy of the flow
     55// Check the optimalitiy of the flow
    5656template < typename Digraph, typename CostMap,
    5757           typename FlowMap, typename PotentialMap >
     
    5959                      const FlowMap& flow, const PotentialMap& pi )
    6060{
    61   // Checking the Complementary Slackness optimality condition
     61  // Check the "Complementary Slackness" optimality condition
    6262  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
    6363  bool opt = true;
     
    7272}
    7373
    74 // Checks a path
    75 template < typename Digraph, typename Path >
     74// Check a path
     75template <typename Digraph, typename Path>
    7676bool checkPath( const Digraph& gr, const Path& path,
    7777                typename Digraph::Node s, typename Digraph::Node t)
    7878{
    79   // Checking the Complementary Slackness optimality condition
     79  // Check the "Complementary Slackness" optimality condition
    8080  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
    8181  Node n = s;
     
    9292  DIGRAPH_TYPEDEFS(ListDigraph);
    9393
    94   // Reading the test digraph
     94  // Read the test digraph
    9595  ListDigraph digraph;
    9696  ListDigraph::ArcMap<int> length(digraph);
     
    112112  input.close();
    113113 
    114   // Finding 2 paths
     114  // Find 2 paths
    115115  {
    116116    Suurballe<ListDigraph> suurballe(digraph, length, source, target);
     
    127127  }
    128128
    129   // Finding 3 paths
     129  // Find 3 paths
    130130  {
    131131    Suurballe<ListDigraph> suurballe(digraph, length, source, target);
     
    142142  }
    143143
    144   // Finding 5 paths (only 3 can be found)
     144  // Find 5 paths (only 3 can be found)
    145145  {
    146146    Suurballe<ListDigraph> suurballe(digraph, length, source, target);
Note: See TracChangeset for help on using the changeset viewer.