Changeset 921:818510fa3d99 in lemon-0.x for src/work/marci/leda/bipartite_matching_leda_gen.cc
- Timestamp:
- 09/29/04 17:30:04 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci/leda/bipartite_matching_leda_gen.cc
r769 r921 14 14 //#include <smart_graph.h> 15 15 //#include <dimacs.h> 16 #include < hugo/time_measure.h>16 #include <lemon/time_measure.h> 17 17 #include <for_each_macros.h> 18 #include < hugo/graph_wrapper.h>18 #include <lemon/graph_wrapper.h> 19 19 #include <bipartite_graph_wrapper.h> 20 #include < hugo/maps.h>21 #include < hugo/max_flow.h>20 #include <lemon/maps.h> 21 #include <lemon/max_flow.h> 22 22 #include <augmenting_flow.h> 23 23 … … 44 44 } 45 45 46 using namespace hugo;46 using namespace lemon; 47 47 48 48 int main() { … … 111 111 max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/); 112 112 max_flow_test.run(); 113 std::cout << " HUGOmax matching algorithm based on preflow." << std::endl113 std::cout << "LEMON max matching algorithm based on preflow." << std::endl 114 114 << "Size of matching: " 115 115 << max_flow_test.flowValue() << std::endl; … … 130 130 max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/); 131 131 while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { } 132 std::cout << " HUGOmax matching algorithm based on blocking flow augmentation."132 std::cout << "LEMON max matching algorithm based on blocking flow augmentation." 133 133 << std::endl << "Matching size: " 134 134 << max_flow_test_1.flowValue() << std::endl;
Note: See TracChangeset
for help on using the changeset viewer.