Changeset 1866:c2de2ed28e59 in lemon-0.x

Timestamp:

12/19/05 15:58:09 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

New file and data structures: sub_graph
Moved to new group with the edge_sets

Files:

• doc/groups.dox (modified) (2 diffs)
• lemon/Makefile.am (modified) (1 diff)
• lemon/edge_set.h (modified) (3 diffs)
• lemon/sub_graph.h (added)

doc/groups.dox

@@ -41 +41 @@
 
 /**
+@defgroup semi_adaptors Semi-Adaptors Classes for Graphs
+@ingroup graphs
+\brief Graph types between real graphs and graph adaptors.
+
+Graph types between real graphs and graph adaptors. These classes
+wrap graphs to give new functionality as the adaptors do it. But the
+other way they are not light-weigth structures as the adaptors.
+*/
+
+/**
 @defgroup maps Maps 
 @ingroup datas
@@ -48 +58 @@
 new maps from existing ones.
 */
-
 
 /**

lemon/Makefile.am

@@ -63 +63 @@
         radix_sort.h \
         smart_graph.h \
+        sub_graph.h \
         time_measure.h \
         topology.h \

lemon/edge_set.h

@@ -193 +193 @@
   };
 
-  /// \ingroup graphs
+  /// \ingroup semi_adaptors
   ///
   /// \brief Graph using a node set of another graph and an
@@ -292 +292 @@
   };
 
-  /// \ingroup graphs
+  /// \ingroup semi_adaptors
   ///
   /// \brief Graph using a node set of another graph and an
@@ -364 +364 @@
         Parent::erase(node);
       }
+      virtual void erase(const std::vector<Node>& nodes) {
+        for (int i = 0; i < nodes.size(); ++i) {
+          _edgeset.eraseNode(nodes[i]);
+        }
+        Parent::erase(nodes);
+      }
       virtual void clear() {
         _edgeset.clearNodes();