COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/04/04 16:54:21 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@693
Message:

Nem tudom, a hugo-n miert nem megy.

File:
1 copied

Legend:

Unmodified
Added
Removed
  • src/work/athos/mincostflows_test.cc

    r520 r527  
    11#include <iostream>
    22#include <list_graph.h>
    3 #include <minlengthpaths.h>
    4 #include <path.h>
     3#include <mincostflows.h>
     4//#include <path.h>
     5#include <maps.h>
    56
    67using namespace std;
     
    6162  length.set(v5_t, 8);
    6263
     64  ConstMap const1map(1);
    6365  std::cout << "Minlengthpaths algorithm test..." << std::endl;
    6466
    6567 
    6668  int k=3;
    67   MinLengthPaths< ListGraph, ListGraph::EdgeMap<int> >
    68     surb_test(graph, length);
     69  MinCostFlows< ListGraph, ListGraph::EdgeMap<int> >
     70    surb_test(graph, length, const1map);
    6971
    7072  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
Note: See TracChangeset for help on using the changeset viewer.