equal
deleted
inserted
replaced
127 std::cout << "names and capacity values" << std::endl; |
127 std::cout << "names and capacity values" << std::endl; |
128 for(EachNodeIt i=flow_test.first_node(); i.valid(); ++i) { |
128 for(EachNodeIt i=flow_test.first_node(); i.valid(); ++i) { |
129 std::cout << node_name.get(i) << ": "; |
129 std::cout << node_name.get(i) << ": "; |
130 std::cout << "out edges: "; |
130 std::cout << "out edges: "; |
131 for(out_edge_iterator j=flow_test.first_out_edge(i); j.valid(); ++j) |
131 for(out_edge_iterator j=flow_test.first_out_edge(i); j.valid(); ++j) |
132 std::cout << node_name.get(flow_test.tail(j)) << "-"<< cap.get(j) << "->" << node_name.get(flow_test.head(j)) << " "; |
132 std::cout << node_name.get(flow_test.source(j)) << "-"<< cap.get(j) << "->" << node_name.get(flow_test.target(j)) << " "; |
133 std::cout << "in edges: "; |
133 std::cout << "in edges: "; |
134 for(in_edge_iterator j=flow_test.first_in_edge(i); j.valid(); ++j) |
134 for(in_edge_iterator j=flow_test.first_in_edge(i); j.valid(); ++j) |
135 std::cout << node_name.get(flow_test.tail(j)) << "-"<< cap.get(j) << "->" << node_name.get(flow_test.head(j)) << " "; |
135 std::cout << node_name.get(flow_test.source(j)) << "-"<< cap.get(j) << "->" << node_name.get(flow_test.target(j)) << " "; |
136 std::cout << std::endl; |
136 std::cout << std::endl; |
137 } |
137 } |
138 */ |
138 */ |
139 |
139 |
140 //for(each_NodeIt i=flow_test.first_node(); i.valid(); ++i) { |
140 //for(each_NodeIt i=flow_test.first_node(); i.valid(); ++i) { |