Changeset 510:72143568cadc in lemon0.x for src/work/marci/bipartite_matching_try_2.cc
 Timestamp:
 05/03/04 12:04:27 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@670
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/bipartite_matching_try_2.cc
r501 r510 73 73 } 74 74 75 std::cout << "Edges of the bipartite graph:" << std::endl;76 FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " ";77 std::cout << std::endl;75 // std::cout << "Edges of the bipartite graph:" << std::endl; 76 // FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " "; 77 // std::cout << std::endl; 78 78 79 std::cout << "Nodes:" << std::endl;80 FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " ";81 std::cout << std::endl;82 std::cout << "Nodes in T:" << std::endl;83 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";84 std::cout << std::endl;85 std::cout << "Nodes in S:" << std::endl;86 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";87 std::cout << std::endl;79 // std::cout << "Nodes:" << std::endl; 80 // FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " "; 81 // std::cout << std::endl; 82 // std::cout << "Nodes in T:" << std::endl; 83 // FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " "; 84 // std::cout << std::endl; 85 // std::cout << "Nodes in S:" << std::endl; 86 // FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " "; 87 // std::cout << std::endl; 88 88 89 std::cout << "Erasing the first node..." << std::endl;90 NodeIt n;91 g.first(n);92 g.erase(n);93 std::cout << "Nodes of the bipartite graph:" << std::endl;94 FOR_EACH_GLOB(n, g) std::cout << n << " ";95 std::cout << std::endl;89 // std::cout << "Erasing the first node..." << std::endl; 90 // NodeIt n; 91 // g.first(n); 92 // g.erase(n); 93 // std::cout << "Nodes of the bipartite graph:" << std::endl; 94 // FOR_EACH_GLOB(n, g) std::cout << n << " "; 95 // std::cout << std::endl; 96 96 97 std::cout << "Nodes in T:" << std::endl;98 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";99 std::cout << std::endl;100 std::cout << "Nodes in S:" << std::endl;101 FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";102 std::cout << std::endl;97 // std::cout << "Nodes in T:" << std::endl; 98 // FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " "; 99 // std::cout << std::endl; 100 // std::cout << "Nodes in S:" << std::endl; 101 // FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " "; 102 // std::cout << std::endl; 103 103 104 104 typedef stGraphWrapper<Graph> stGW; … … 120 120 std::cout << "max flow value: " << max_flow_test.flowValue() << std::endl; 121 121 std::cout << "elapsed time: " << ts << std::endl; 122 FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {123 if (flow[e]) std::cout << e << std::endl;124 }125 std::cout << std::endl;122 // FOR_EACH_LOC(stGW::EdgeIt, e, stgw) { 123 // if (flow[e]) std::cout << e << std::endl; 124 // } 125 // std::cout << std::endl; 126 126 127 127 return 0;
Note: See TracChangeset
for help on using the changeset viewer.