COIN-OR::LEMON - Graph Library

Changeset 545:e72bacfea6b7 in lemon-1.2 for test


Ignore:
Timestamp:
02/25/09 12:10:57 (10 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Remane GomoryHuTree? to GomoryHu? (#66)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/gomory_hu_test.cc

    r544 r545  
    44#include <lemon/smart_graph.h>
    55#include <lemon/lgf_reader.h>
    6 #include <lemon/gomory_hu_tree.h>
     6#include <lemon/gomory_hu.h>
    77#include <cstdlib>
    88
     
    6161    edgeMap("capacity", capacity).run();
    6262
    63   GomoryHuTree<Graph> ght(graph, capacity);
     63  GomoryHu<Graph> ght(graph, capacity);
    6464  ght.init();
    6565  ght.run();
     
    7676
    7777      int sum=0;
    78       for(GomoryHuTree<Graph>::MinCutEdgeIt a(ght, u, v);a!=INVALID;++a)
     78      for(GomoryHu<Graph>::MinCutEdgeIt a(ght, u, v);a!=INVALID;++a)
    7979        sum+=capacity[a];
    8080      check(sum == ght.minCutValue(u, v), "Problem with MinCutEdgeIt");
    8181
    8282      sum=0;
    83       for(GomoryHuTree<Graph>::MinCutNodeIt n(ght, u, v,true);n!=INVALID;++n)
     83      for(GomoryHu<Graph>::MinCutNodeIt n(ght, u, v,true);n!=INVALID;++n)
    8484        sum++;
    85       for(GomoryHuTree<Graph>::MinCutNodeIt n(ght, u, v,false);n!=INVALID;++n)
     85      for(GomoryHu<Graph>::MinCutNodeIt n(ght, u, v,false);n!=INVALID;++n)
    8686        sum++;
    8787      check(sum == countNodes(graph), "Problem with MinCutNodeIt");
Note: See TracChangeset for help on using the changeset viewer.