gravatar
deba@inf.elte.hu
deba@inf.elte.hu
Erase in the documentation of list graphs
0 1 0
default
1 file changed with 24 insertions and 0 deletions:
↑ Collapse diff ↑
Ignore white space 12 line context
... ...
@@ -360,12 +360,24 @@
360 360
    ///and target node \c t.
361 361
    ///\return the new arc.
362 362
    Arc addArc(const Node& s, const Node& t) {
363 363
      return Parent::addArc(s, t);
364 364
    }
365 365

	
366
    ///\brief Erase a node from the digraph.
367
    ///
368
    ///Erase a node from the digraph.
369
    ///
370
    void erase(const Node& n) { Parent::erase(n); }
371

	
372
    ///\brief Erase an arc from the digraph.
373
    ///
374
    ///Erase an arc from the digraph.
375
    ///
376
    void erase(const Arc& a) { Parent::erase(a); }
377

	
366 378
    /// Node validity check
367 379

	
368 380
    /// This function gives back true if the given node is valid,
369 381
    /// ie. it is a real node of the graph.
370 382
    ///
371 383
    /// \warning A Node pointing to a removed item
... ...
@@ -1204,12 +1216,24 @@
1204 1216
    /// Add a new edge to the graph with source node \c s
1205 1217
    /// and target node \c t.
1206 1218
    /// \return the new edge.
1207 1219
    Edge addEdge(const Node& s, const Node& t) {
1208 1220
      return Parent::addEdge(s, t);
1209 1221
    }
1222

	
1223
    /// \brief Erase a node from the graph.
1224
    ///
1225
    /// Erase a node from the graph.
1226
    ///
1227
    void erase(const Node& n) { Parent::erase(n); }
1228

	
1229
    /// \brief Erase an edge from the graph.
1230
    ///
1231
    /// Erase an edge from the graph.
1232
    ///
1233
    void erase(const Edge& e) { Parent::erase(e); }
1210 1234
    /// Node validity check
1211 1235

	
1212 1236
    /// This function gives back true if the given node is valid,
1213 1237
    /// ie. it is a real node of the graph.
1214 1238
    ///
1215 1239
    /// \warning A Node pointing to a removed item
0 comments (0 inline)