Changeset 592:e72bacfea6b7 in lemon for test/gomory_hu_test.cc
 Timestamp:
 02/25/09 12:10:57 (12 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

test/gomory_hu_test.cc
r591 r592 4 4 #include <lemon/smart_graph.h> 5 5 #include <lemon/lgf_reader.h> 6 #include <lemon/gomory_hu _tree.h>6 #include <lemon/gomory_hu.h> 7 7 #include <cstdlib> 8 8 … … 61 61 edgeMap("capacity", capacity).run(); 62 62 63 GomoryHu Tree<Graph> ght(graph, capacity);63 GomoryHu<Graph> ght(graph, capacity); 64 64 ght.init(); 65 65 ght.run(); … … 76 76 77 77 int sum=0; 78 for(GomoryHu Tree<Graph>::MinCutEdgeIt a(ght, u, v);a!=INVALID;++a)78 for(GomoryHu<Graph>::MinCutEdgeIt a(ght, u, v);a!=INVALID;++a) 79 79 sum+=capacity[a]; 80 80 check(sum == ght.minCutValue(u, v), "Problem with MinCutEdgeIt"); 81 81 82 82 sum=0; 83 for(GomoryHu Tree<Graph>::MinCutNodeIt n(ght, u, v,true);n!=INVALID;++n)83 for(GomoryHu<Graph>::MinCutNodeIt n(ght, u, v,true);n!=INVALID;++n) 84 84 sum++; 85 for(GomoryHu Tree<Graph>::MinCutNodeIt n(ght, u, v,false);n!=INVALID;++n)85 for(GomoryHu<Graph>::MinCutNodeIt n(ght, u, v,false);n!=INVALID;++n) 86 86 sum++; 87 87 check(sum == countNodes(graph), "Problem with MinCutNodeIt");
Note: See TracChangeset
for help on using the changeset viewer.