Changeset 497:500456d50d21 in lemon-0.x

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

Location:

src/work/marci

Files:

• bipartite_graph_wrapper.h (modified) (2 diffs)
• graph_wrapper.h (modified) (5 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>

src/work/marci/graph_wrapper.h

@@ -89 +89 @@
   protected:
     Graph* graph;
-  
+    GraphWrapper() : graph(0) { }
+    void setGraph(Graph& _graph) { graph=&_graph; }
+
   public:
     typedef Graph BaseGraph;
     typedef Graph ParentGraph;
 
-//     GraphWrapper() : graph(0) { }
     GraphWrapper(Graph& _graph) : graph(&_graph) { }
-//     void setGraph(Graph& _graph) { graph=&_graph; }
 //     Graph& getGraph() const { return *graph; }
  
@@ -226 +226 @@
   template<typename Graph>
   class RevGraphWrapper : public GraphWrapper<Graph> {
+  protected:
+    RevGraphWrapper() : GraphWrapper<Graph>(0) { }
   public:
-
     RevGraphWrapper(Graph& _graph) : GraphWrapper<Graph>(_graph) { }  
 
@@ -306 +307 @@
     NodeFilterMap* node_filter_map;
     EdgeFilterMap* edge_filter_map;
+
+    SubGraphWrapper() : GraphWrapper<Graph>(0), 
+                        node_filter_map(0), edge_filter_map(0) { }
+    void setNodeFilterMap(NodeFilterMap& _node_filter_map) {
+      node_filter_map=&_node_filte_map;
+    }
+    void setEdgeFilterMap(EdgeFilterMap& _edge_filter_map) {
+      edge_filter_map=&_edge_filte_map;
+    }
+    
   public:
 
@@ -454 +465 @@
   template<typename Graph>
   class UndirGraphWrapper : public GraphWrapper<Graph> {
+  protected:
+    UndirGraphWrapper() : GraphWrapper<Graph>(0) { }
+    
   public:
     typedef typename GraphWrapper<Graph>::Node Node;
@@ -537 +551 @@
     const CapacityMap* capacity;
     FlowMap* flow;
+
+    ResGraphWrapper() : GraphWrapper<Graph>(0), 
+                        capacity(0), flow(0) { }
+    void setCapacityMap(const CapacityMap& _capacity_map) {
+      capacity_map=&_capacity_map;
+    }
+    void setFlowMap(FlowMap& _flow) {
+      flow=&_flow;
+    }
+
   public: