Changeset 769:eb61fbc64c16 in lemon-0.x for src/work/marci/leda/bipartite_matching_leda_gen.cc
- Timestamp:
- 08/23/04 13:26:09 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1032
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci/leda/bipartite_matching_leda_gen.cc
r768 r769 15 15 //#include <dimacs.h> 16 16 #include <hugo/time_measure.h> 17 #include < hugo/for_each_macros.h>17 #include <for_each_macros.h> 18 18 #include <hugo/graph_wrapper.h> 19 19 #include <bipartite_graph_wrapper.h> 20 20 #include <hugo/maps.h> 21 #include <max_flow.h> 21 #include <hugo/max_flow.h> 22 #include <augmenting_flow.h> 22 23 23 24 /** … … 126 127 FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0); 127 128 typedef SageGraph MutableGraph; 128 while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { } 129 AugmentingFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 130 max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/); 131 while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { } 129 132 std::cout << "HUGO max matching algorithm based on blocking flow augmentation." 130 133 << std::endl << "Matching size: " 131 << max_flow_test .flowValue() << std::endl;134 << max_flow_test_1.flowValue() << std::endl; 132 135 std::cout << "elapsed time: " << ts << std::endl; 133 136
Note: See TracChangeset
for help on using the changeset viewer.