diff -r c3f93631cd24 -r a5bff2813c4d src/work/marci/bipartite_graph_wrapper_test.cc
--- a/src/work/marci/bipartite_graph_wrapper_test.cc	Thu Apr 22 20:36:21 2004 +0000
+++ b/src/work/marci/bipartite_graph_wrapper_test.cc	Fri Apr 23 07:41:48 2004 +0000
@@ -10,6 +10,8 @@
 #include <for_each_macros.h>
 #include <bfs_iterator.h>
 #include <graph_wrapper.h>
+#include <maps.h>
+#include <edmonds_karp.h>
 
 using namespace hugo;
 
@@ -41,44 +43,35 @@
   FOR_EACH_LOC(BGW::EdgeIt, e, bgw) {
     std::cout << bgw.tail(e) << "->" << bgw.head(e) << std::endl;
   }
-//   Graph::NodeMap<OutEdgeIt> pred(G);
-//   Timer ts;
-//   {
-//     ts.reset();
-//     Graph::NodeMap<bool> reached(G);
-//     reached.set(s, true);
-//     pred.set(s, INVALID);
-//     std::queue<Node> bfs_queue;
-//     bfs_queue.push(t);
-//     while (!bfs_queue.empty()) {
-//       Node v=bfs_queue.front();	
-//       bfs_queue.pop();
-//       OutEdgeIt e;
-//       for(G.first(e,v); G.valid(e); G.next(e)) {
-// 	Node w=G.head(e);
-// 	if (!reached[w]) {
-// 	  bfs_queue.push(w);
-// 	  reached.set(w, true);
-// 	  pred.set(w, e);
-// 	}
-//       }
-//     }
 
-//     std::cout << ts << std::endl;
-//   }
+  BGW::NodeMap<int> dbyj(bgw);
+  BGW::EdgeMap<int> dbyxcj(bgw);
 
-//   {
-//     ts.reset();      
-//     BfsIterator< Graph, Graph::NodeMap<bool> > bfs(G);
-//     bfs.pushAndSetReached(s);
-//     pred.set(s, INVALID);
-//     while (!bfs.finished()) { 
-//       ++bfs; 
-//       if (G.valid(bfs) && bfs.isBNodeNewlyReached()) 
-// 	pred.set(bfs.bNode(), bfs);
-//     }
-//     std::cout << ts << std::endl;
-//   }
+  typedef stGraphWrapper<BGW> stGW;
+  stGW stgw(bgw);
+  ConstMap<stGW::Edge, int> const1map(1);
+  stGW::NodeMap<int> ize(stgw);
+  stGW::EdgeMap<int> flow(stgw);
+
+  BfsIterator< BGW, BGW::NodeMap<bool> > bfs(bgw);
+  Graph::NodeIt si;
+  Graph::Node s; 
+  s=g.first(si);
+  bfs.pushAndSetReached(BGW::Node(s));
+  while (!bfs.finished()) ++bfs;
+
+  BGW::EdgeMap<bool> cap(bgw);
+  BGW::EdgeMap<bool> flow1(bgw);
+
+  typedef ResGraphWrapper< BGW, int, BGW::EdgeMap<bool>, BGW::EdgeMap<bool> > 
+    RBGW;
+  RBGW rbgw(bgw, cap, flow1);
+  RBGW::NodeMap<int> u(rbgw);
+  
+
+  MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
+    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow);
+  max_flow_test.augmentOnShortestPath();
 
   return 0;
 }