Changeset 1538:777834118f73 in lemon-0.x for lemon/graph_adaptor.h

Timestamp:

07/04/05 19:22:03 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

NewUndirEdgeSetAdaptor? class
some doc
some bug fix

File:

• lemon/graph_adaptor.h (modified) (4 diffs)

lemon/graph_adaptor.h

@@ -1216 +1216 @@
   };
 
-  /// \e
   template <typename _Graph>
   class NewEdgeSetAdaptorBase {
@@ -1414 +1413 @@
   };
 
+
+  /// \brief Graph adaptor using a node set of another graph and an
+  /// own edge set.
+  ///
+  /// This structure can be used to establish another graph over a node set
+  /// of an existing one. The node iterator will go through the nodes of the
+  /// original graph.
+  ///
+  /// \param _Graph The type of the graph which shares its node set with 
+  /// this class. Its interface must conform to the \ref skeleton::StaticGraph
+  /// "StaticGraph" concept.
+  ///
+  /// In the edge extension and removing it conforms to the 
+  /// \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
   template <typename _Graph>
   class NewEdgeSetAdaptor :
@@ -1476 +1489 @@
   public:
 
+    /// \brief Constructor of the adaptor.
+    /// 
+    /// Constructor of the adaptor.
     NewEdgeSetAdaptor(const _Graph& _graph) : nodes(*this, _graph) {
       Parent::initalize(_graph, nodes);
@@ -1481 +1497 @@
 
     void clear() {
+      Parent::getNotifier(Edge()).clear();      
+
       Parent::edges.clear();
       Parent::first_edge = -1;
       Parent::first_free_edge = -1;
-
+    }
+    
+  };
+
+  /// \brief Graph adaptor using a node set of another graph and an
+  /// own undir edge set.
+  ///
+  /// This structure can be used to establish another undirected graph over 
+  /// a node set of an existing one. The node iterator will go through the 
+  /// nodes of the original graph.
+  ///
+  /// \param _Graph The type of the graph which shares its node set with 
+  /// this class. Its interface must conform to the \ref skeleton::StaticGraph
+  /// "StaticGraph" concept.
+  ///
+  /// In the edge extension and removing it conforms to the 
+  /// \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
+  template <typename _Graph>
+  class NewUndirEdgeSetAdaptor :
+    public ErasableUndirGraphExtender<
+    ClearableUndirGraphExtender<
+    ExtendableUndirGraphExtender<
+    MappableUndirGraphExtender<
+    IterableUndirGraphExtender<
+    AlterableUndirGraphExtender<
+    UndirGraphExtender<
+    NewEdgeSetAdaptorBase<_Graph> > > > > > > > {
+
+  public:
+
+    typedef ErasableUndirGraphExtender<
+      ClearableUndirGraphExtender<
+      ExtendableUndirGraphExtender<
+      MappableUndirGraphExtender<
+      IterableUndirGraphExtender<
+      AlterableUndirGraphExtender<
+      UndirGraphExtender<
+      NewEdgeSetAdaptorBase<_Graph> > > > > > > > Parent;
+    
+
+    typedef typename Parent::Node Node;
+    typedef typename Parent::Edge Edge;
+    typedef typename Parent::UndirEdge UndirEdge;
+
+  private:
+
+    virtual void _clear() {
+      Parent::edges.clear();
+      Parent::first_edge = -1;
+      Parent::first_free_edge = -1;
+      Parent::getNotifier(Edge()).clear();
+      Parent::getNotifier(Node()).clear();
+    }
+
+    virtual void _add(const Node& node) {
+      Parent::getNotifier(Node()).add(node);
+    }
+
+    virtual void _erase(const Node& node) {
+      Edge edge;
+      Parent::firstOut(edge, node);
+      while (edge != INVALID) {
+        Parent::erase(edge);
+        Parent::firstOut(edge, node);
+      }
+
+      Parent::firstIn(edge, node);
+      while (edge != INVALID) {
+        Parent::erase(edge);
+        Parent::firstIn(edge, node);
+      }
+      
+      Parent::getNotifier(Node()).erase(node);
+    }
+
+    typedef typename Parent::NodesImpl NodesImpl;
+
+    NodesImpl nodes;
+    
+  public:
+
+
+    /// \brief Constructor of the adaptor.
+    /// 
+    /// Constructor of the adaptor.
+    NewUndirEdgeSetAdaptor(const _Graph& _graph) : nodes(*this, _graph) {
+      Parent::initalize(_graph, nodes);
+    }
+
+    void clear() {
       Parent::getNotifier(Edge()).clear();      
+      Parent::getNotifier(UndirEdge()).clear();      
+
+      Parent::edges.clear();
+      Parent::first_edge = -1;
+      Parent::first_free_edge = -1;
     }