diff -r 500456d50d21 -r eb8bfa683d92 src/work/marci/bipartite_graph_wrapper.h
--- a/src/work/marci/bipartite_graph_wrapper.h	Fri Apr 30 16:10:49 2004 +0000
+++ b/src/work/marci/bipartite_graph_wrapper.h	Fri Apr 30 16:46:19 2004 +0000
@@ -205,14 +205,26 @@
 
     /// the \c bool parameter which can be \c S_Class or \c T_Class shows 
     /// the color class where the new node is to be inserted.
-    void addNode(bool);
+    Node addNode(bool b) {
+      Node n=Parent::graph->addNode();
+      bipartite_map.update();
+      s_false_t_true_map.insert(n, b);
+      return n;
+    }
 
     /// A new edge is inserted.
     ///\pre \c tail have to be in \c S_Class and \c head in \c T_Class.
-    void addEdge(const Node& tail, const Node& head);
+    Edge addEdge(const Node& tail, const Node& head) {
+      return Parent::graph->addEdge(tail, head);
+    }
 
-    void erase(const Node&);
-    void erase(const Edge&);
+    void erase(const Node& n) {
+      s_false_t_true_map.remove(n);
+      Parent::graph->erase(n);
+    }
+    void erase(const Edge& e) {
+      Parent::graph->erase(e);
+    }
     
     void clear() {
       FOR_EACH_LOC(typename Parent::EdgeIt, e, G) erase(e);