Changeset 60:89d2ce014e12 in lemon-0.x

Timestamp:

02/04/04 13:59:17 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@75

Message:

.

File:

• src/work/marci_graph_demo.cc (modified) (3 diffs)

src/work/marci_graph_demo.cc

@@ -166 +166 @@
   }
 
+  //flowG.deleteEdge(s_v1);
+  //flowG.deleteEdge(s_v2);
+  //flowG.deleteEdge(v1_v2);
+  //flowG.deleteEdge(v1_v3);
+  
+
   //flowG.setTail(v3_t, v2);
   //flowG.setHead(v3_t, s);
@@ -180 +186 @@
   }
   
+  for(EachEdgeIt e=flowG.first<EachEdgeIt>(); e.valid(); ++e) {
+    std::cout << node_name.get(flowG.tail(e)) << "-"<< cap.get(e) << "->" << node_name.get(flowG.head(e)) << " ";
+  }
 
   /*
@@ -211 +220 @@
   */
 
-  //ListGraph::EdgeMap<int> flow(flowG, 0);
-  //ResGraph<ListGraph, int> res_graph(flowG, cap, flow); 
-  max_flow_type<ListGraph, int> max_flow_test(flowG, s, t, cap);
+  std::cout << std::endl;
+  //std::cout << "meg jo" << std::flush;
+
+  ListGraph::EdgeMap<int> flow(flowG, 0);
+  MaxFlow<ListGraph, int, ListGraph::EdgeMap<int>, ListGraph::EdgeMap<int> > max_flow_test(flowG, s, t, flow, cap);
   max_flow_test.run();
+
+  std::cout << "maximum flow: "<< std::endl;
+  for(EachEdgeIt e=flowG.template first<EachEdgeIt>(); e.valid(); ++e) { 
+    std::cout<<"("<<flowG.tail(e)<< "-"<<flow.get(e)<<"->"<<flowG.head(e)<<") ";
+  }
+  std::cout<<std::endl;
 
   return 0;