Changeset 1866:c2de2ed28e59 in lemon-0.x
- Timestamp:
- 12/19/05 15:58:09 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2440
- Files:
-
- 1 added
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r1847 r1866 41 41 42 42 /** 43 @defgroup semi_adaptors Semi-Adaptors Classes for Graphs 44 @ingroup graphs 45 \brief Graph types between real graphs and graph adaptors. 46 47 Graph types between real graphs and graph adaptors. These classes 48 wrap graphs to give new functionality as the adaptors do it. But the 49 other way they are not light-weigth structures as the adaptors. 50 */ 51 52 /** 43 53 @defgroup maps Maps 44 54 @ingroup datas … … 48 58 new maps from existing ones. 49 59 */ 50 51 60 52 61 /** -
lemon/Makefile.am
r1864 r1866 63 63 radix_sort.h \ 64 64 smart_graph.h \ 65 sub_graph.h \ 65 66 time_measure.h \ 66 67 topology.h \ -
lemon/edge_set.h
r1842 r1866 193 193 }; 194 194 195 /// \ingroup graphs195 /// \ingroup semi_adaptors 196 196 /// 197 197 /// \brief Graph using a node set of another graph and an … … 292 292 }; 293 293 294 /// \ingroup graphs294 /// \ingroup semi_adaptors 295 295 /// 296 296 /// \brief Graph using a node set of another graph and an … … 364 364 Parent::erase(node); 365 365 } 366 virtual void erase(const std::vector<Node>& nodes) { 367 for (int i = 0; i < nodes.size(); ++i) { 368 _edgeset.eraseNode(nodes[i]); 369 } 370 Parent::erase(nodes); 371 } 366 372 virtual void clear() { 367 373 _edgeset.clearNodes();
Note: See TracChangeset
for help on using the changeset viewer.