equal
deleted
inserted
replaced
190 : Parent(*edgeset.graph, value) { } |
190 : Parent(*edgeset.graph, value) { } |
191 }; |
191 }; |
192 |
192 |
193 }; |
193 }; |
194 |
194 |
195 /// \ingroup graphs |
195 /// \ingroup semi_adaptors |
196 /// |
196 /// |
197 /// \brief Graph using a node set of another graph and an |
197 /// \brief Graph using a node set of another graph and an |
198 /// own edge set. |
198 /// own edge set. |
199 /// |
199 /// |
200 /// This structure can be used to establish another graph over a node set |
200 /// This structure can be used to establish another graph over a node set |
289 Parent::initalize(graph, nodes); |
289 Parent::initalize(graph, nodes); |
290 } |
290 } |
291 |
291 |
292 }; |
292 }; |
293 |
293 |
294 /// \ingroup graphs |
294 /// \ingroup semi_adaptors |
295 /// |
295 /// |
296 /// \brief Graph using a node set of another graph and an |
296 /// \brief Graph using a node set of another graph and an |
297 /// own undir edge set. |
297 /// own undir edge set. |
298 /// |
298 /// |
299 /// This structure can be used to establish another graph over a node set |
299 /// This structure can be used to establish another graph over a node set |
361 |
361 |
362 virtual void erase(const Node& node) { |
362 virtual void erase(const Node& node) { |
363 _edgeset.eraseNode(node); |
363 _edgeset.eraseNode(node); |
364 Parent::erase(node); |
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 virtual void clear() { |
372 virtual void clear() { |
367 _edgeset.clearNodes(); |
373 _edgeset.clearNodes(); |
368 Parent::clear(); |
374 Parent::clear(); |
369 } |
375 } |
370 |
376 |