COIN-OR::LEMON - Graph Library

Changeset 611:83530dad618a in lemon-0.x


Ignore:
Timestamp:
05/11/04 18:38:17 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@793
Message:

Some modifications and another testfile.

Location:
src
Files:
1 added
1 deleted
3 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/mincostflows.h

    r610 r611  
    77///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost
    88
    9 #include <iostream>
     9
    1010#include <hugo/dijkstra.h>
    1111#include <hugo/graph_wrapper.h>
  • src/hugo/minlengthpaths.h

    r610 r611  
    77///\brief An algorithm for finding k paths of minimal total length.
    88
    9 #include <iostream>
     9
    1010//#include <hugo/dijkstra.h>
    1111//#include <hugo/graph_wrapper.h>
  • src/test/minlengthpaths_test.cc

    r610 r611  
    33#include <hugo/minlengthpaths.h>
    44#include <path.h>
     5#include "test_tools.h"
    56
    67using namespace std;
     
    1011
    1112bool passed = true;
    12 
    13 void check(bool rc, char *msg="") {
    14   passed = passed && rc;
    15   if(!rc) {
    16     std::cerr << "Test failed! ("<< msg << ")" << std::endl; \
    17  
    18 
    19   }
    20 }
    21 
    2213
    2314
Note: See TracChangeset for help on using the changeset viewer.