equal
deleted
inserted
replaced
361 ///\return the new arc. |
361 ///\return the new arc. |
362 Arc addArc(const Node& s, const Node& t) { |
362 Arc addArc(const Node& s, const Node& t) { |
363 return Parent::addArc(s, t); |
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 /// Node validity check |
378 /// Node validity check |
367 |
379 |
368 /// This function gives back true if the given node is valid, |
380 /// This function gives back true if the given node is valid, |
369 /// ie. it is a real node of the graph. |
381 /// ie. it is a real node of the graph. |
370 /// |
382 /// |
1205 /// and target node \c t. |
1217 /// and target node \c t. |
1206 /// \return the new edge. |
1218 /// \return the new edge. |
1207 Edge addEdge(const Node& s, const Node& t) { |
1219 Edge addEdge(const Node& s, const Node& t) { |
1208 return Parent::addEdge(s, t); |
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 /// Node validity check |
1234 /// Node validity check |
1211 |
1235 |
1212 /// This function gives back true if the given node is valid, |
1236 /// This function gives back true if the given node is valid, |
1213 /// ie. it is a real node of the graph. |
1237 /// ie. it is a real node of the graph. |
1214 /// |
1238 /// |