Changeset 787:c2230649a493 in lemon1.2 for lemon/list_graph.h
 Timestamp:
 11/15/09 19:57:02 (10 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/list_graph.h
r741 r787 325 325 ///only in the concept class. 326 326 /// 327 ///This class provides only linear time counting for nodes and arcs. 328 /// 327 329 ///\sa concepts::Digraph 328 330 ///\sa ListGraph … … 361 363 ///\brief Erase a node from the digraph. 362 364 /// 363 ///This function erases the given node from the digraph. 365 ///This function erases the given node along with its outgoing and 366 ///incoming arcs from the digraph. 367 /// 368 ///\note All iterators referencing the removed node or the connected 369 ///arcs are invalidated, of course. 364 370 void erase(Node n) { Parent::erase(n); } 365 371 … … 367 373 /// 368 374 ///This function erases the given arc from the digraph. 375 /// 376 ///\note All iterators referencing the removed arc are invalidated, 377 ///of course. 369 378 void erase(Arc a) { Parent::erase(a); } 370 379 … … 511 520 ///This function erases all nodes and arcs from the digraph. 512 521 /// 522 ///\note All iterators of the digraph are invalidated, of course. 513 523 void clear() { 514 524 Parent::clear(); … … 1180 1190 ///only in the concept class. 1181 1191 /// 1192 ///This class provides only linear time counting for nodes, edges and arcs. 1193 /// 1182 1194 ///\sa concepts::Graph 1183 1195 ///\sa ListDigraph … … 1218 1230 ///\brief Erase a node from the graph. 1219 1231 /// 1220 /// This function erases the given node from the graph. 1232 /// This function erases the given node along with its incident arcs 1233 /// from the graph. 1234 /// 1235 /// \note All iterators referencing the removed node or the incident 1236 /// edges are invalidated, of course. 1221 1237 void erase(Node n) { Parent::erase(n); } 1222 1238 … … 1224 1240 /// 1225 1241 /// This function erases the given edge from the graph. 1242 /// 1243 /// \note All iterators referencing the removed edge are invalidated, 1244 /// of course. 1226 1245 void erase(Edge e) { Parent::erase(e); } 1227 1246 /// Node validity check … … 1313 1332 ///This function erases all nodes and arcs from the graph. 1314 1333 /// 1334 ///\note All iterators of the graph are invalidated, of course. 1315 1335 void clear() { 1316 1336 Parent::clear();
Note: See TracChangeset
for help on using the changeset viewer.