Changeset 497:500456d50d21 in lemon-0.x for src/work/marci/bipartite_graph_wrapper.h

Timestamp:

04/30/04 18:10:49 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

bipartite graph in bipartite_graph_wrapper.h

File:

• src/work/marci/bipartite_graph_wrapper.h (modified) (2 diffs)

src/work/marci/bipartite_graph_wrapper.h

@@ -27 +27 @@
   template<typename Graph> 
   class BipartiteGraphWrapper : public GraphWrapper<Graph> {
+  protected:
     typedef IterableBoolMap< typename Graph::template NodeMap<int> > 
     SFalseTTrueMap;
     SFalseTTrueMap* s_false_t_true_map;
+
+    BipartiteGraphWrapper() : GraphWrapper<Graph>(0) { }
+    void setSFalseTTrueMap(SFalseTTrueMap& _s_false_t_true_map) { 
+      s_false_t_true_map=_s_false_t_true_map;
+    }
 
   public:
@@ -176 +182 @@
     }
   };
+
+  ///\bug Do not use this while the bipartitemap augmentation 
+  /// does not work well.
+  template<typename Graph>
+  class BipartiteGraph : public BipartiteGraphWrapper<Graph> {
+    typedef IterableBoolMap< typename Graph::template NodeMap<int> > 
+    SFalseTTrueMap;
+    typedef BipartiteGraphWrapper<Graph> Parent;
+  protected:
+    Graph gr;
+    typename Graph::template NodeMap<int> bipartite_map;
+    SFalseTTrueMap s_false_t_true_map;
+  public:
+    typedef typename Parent::Node Node;
+    typedef typename Parent::Edge Edge;
+    BipartiteGraph() : BipartiteGraphWrapper<Graph>(0), 
+                       gr(), bipartite_map(gr), 
+                       s_false_t_true_map(bipartite_map) { 
+      Parent::setGraph(gr); 
+      Parent::setSFalseTTrueMap(bipartite_map);
+    }
+
+    /// 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);
+
+    /// 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);
+
+    void erase(const Node&);
+    void erase(const Edge&);
+    
+    void clear() {
+      FOR_EACH_LOC(typename Parent::EdgeIt, e, G) erase(e);
+      FOR_EACH_LOC(typename Parent::NodeIt, n, G) erase(n);
+    }
+  };
+
 
   template<typename Graph>