# HG changeset patch
# User marci
# Date 1082989159 0
# Node ID 9cb93f692e92a2ca235bd0a60188bafc9533dce4
# Parent  5d48b6773b73f3d9a9953f0b78e0dd57a19b7bb1
misc

diff -r 5d48b6773b73 -r 9cb93f692e92 src/work/marci/bipartite_matching_leda.cc
--- a/src/work/marci/bipartite_matching_leda.cc	Mon Apr 26 11:11:55 2004 +0000
+++ b/src/work/marci/bipartite_matching_leda.cc	Mon Apr 26 14:19:19 2004 +0000
@@ -14,7 +14,7 @@
 //#include <dimacs.h>
 #include <time_measure.h>
 #include <for_each_macros.h>
-#include <bfs_iterator.h>
+//#include <bfs_iterator.h>
 #include <graph_wrapper.h>
 #include <maps.h>
 #include <edmonds_karp.h>
@@ -47,7 +47,7 @@
 int main() {
   //for leda graph
   leda::graph lg;
-  lg.make_undirected();
+  //lg.make_undirected();
   typedef LedaGraphWrapper<leda::graph> Graph;
   Graph g(lg);
 
@@ -203,12 +203,12 @@
 //   std::cout << "\n";
 
   ts.reset();  
-  MAX_CARD_BIPARTITE_MATCHING(lg);
+  leda_list<leda_edge> ml=MAX_CARD_BIPARTITE_MATCHING(lg);
   //  stGW::EdgeMap<int> pre_flow(stgw);
   //Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
   //  pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
   //pre_flow_test.run();
-  //std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
+  std::cout << "leda matching value: " << ml.size() << std::endl;
   std::cout << "elapsed time: " << ts << std::endl;
 //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) { 
 //     std::cout << e << ": " << pre_flow[e] << "\n";