Changeset 2123:85c6f5e82108 in lemon-0.x
- Timestamp:
- 07/11/06 15:51:52 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2836
- Location:
- lemon
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/list_graph.h
r2117 r2123 167 167 /// Adds a new node to the graph. 168 168 169 /// Adds a new node to the graph. 170 /// 169 171 /// \warning It adds the new node to the front of the list. 170 172 /// (i.e. the lastly added node becomes the first.) … … 350 352 ///the changed edge remain valid. However <tt>InEdgeIt</tt>s are 351 353 ///invalidated. 354 ///\warning This functionality cannot be used together with the Snapshot 355 ///feature. 352 356 void changeTarget(Edge e, Node n) { 353 357 Parent::changeTarget(e,n); … … 360 364 ///the changed edge remain valid. However <tt>OutEdgeIt</tt>s are 361 365 ///invalidated. 366 ///\warning This functionality cannot be used together with the Snapshot 367 ///feature. 362 368 void changeSource(Edge e, Node n) { 363 369 Parent::changeSource(e,n); … … 369 375 ///valid. However <tt>OutEdgeIt</tt>s and <tt>InEdgeIt</tt>s are 370 376 ///invalidated. 377 ///\warning This functionality cannot be used together with the Snapshot 378 ///feature. 371 379 void reverseEdge(Edge e) { 372 380 Node t=target(e); … … 380 388 ///Using this it is possible to avoid the superfluous memory 381 389 ///allocation: if you know that the graph you want to build will 382 ///contain at least 10 million nodes then it is worth to reserve390 ///contain at least 10 million nodes then it is worth reserving 383 391 ///space for this amount before starting to build the graph. 384 392 void reserveNode(int n) { nodes.reserve(n); }; … … 405 413 ///valid. However <tt>InEdge</tt>s and <tt>OutEdge</tt>s 406 414 ///may be invalidated. 415 ///\warning This functionality cannot be used together with the Snapshot 416 ///feature. 407 417 void contract(Node a, Node b, bool r = true) 408 418 { … … 681 691 /// \brief Undo the changes until the last snapshot. 682 692 // 683 /// Undo the changes until last snapshot created by save(). 684 /// 685 /// \todo This function might be called undo(). 693 /// Undo the changes until the last snapshot created by save(). 686 694 void restore() { 687 695 detach(); -
lemon/smart_graph.h
r2116 r2123 240 240 ///node and edge deletions</b>. 241 241 ///It conforms to 242 ///the \ref concept::Graph "Graph " concept.242 ///the \ref concept::Graph "Graph concept". 243 243 ///\sa concept::Graph. 244 244 /// … … 371 371 /// node and edge deletions</b>. 372 372 /// Except from this it conforms to 373 /// the \ref concept::UGraph "UGraph " concept.373 /// the \ref concept::UGraph "UGraph concept". 374 374 /// \sa concept::UGraph. 375 375 /// … … 605 605 /// that <b> it does not support node and edge deletions</b>. 606 606 /// Except from this it conforms to 607 /// the \ref concept::BpUGraph "BpUGraph " concept.607 /// the \ref concept::BpUGraph "BpUGraph concept". 608 608 /// \sa concept::BpUGraph. 609 609 ///
Note: See TracChangeset
for help on using the changeset viewer.