Changeset 2102:eb73ab0e4c74 in lemon0.x
 Timestamp:
 06/20/06 17:20:08 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2793
 Location:
 lemon
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bits/graph_extender.h
r2098 r2102 190 190 /// \brief Base node of the iterator 191 191 /// 192 /// Returns the base node (i e. the source in this case) of the iterator192 /// Returns the base node (i.e. the source in this case) of the iterator 193 193 Node baseNode(const OutEdgeIt &e) const { 194 194 return Parent::source(e); … … 196 196 /// \brief Running node of the iterator 197 197 /// 198 /// Returns the running node (i e. the target in this case) of the198 /// Returns the running node (i.e. the target in this case) of the 199 199 /// iterator 200 200 Node runningNode(const OutEdgeIt &e) const { … … 204 204 /// \brief Base node of the iterator 205 205 /// 206 /// Returns the base node (i e. the target in this case) of the iterator206 /// Returns the base node (i.e. the target in this case) of the iterator 207 207 Node baseNode(const InEdgeIt &e) const { 208 208 return Parent::target(e); … … 210 210 /// \brief Running node of the iterator 211 211 /// 212 /// Returns the running node (i e. the source in this case) of the212 /// Returns the running node (i.e. the source in this case) of the 213 213 /// iterator 214 214 Node runningNode(const InEdgeIt &e) const { 
lemon/list_graph.h
r2098 r2102 317 317 ///This is a simple and fast erasable graph implementation. 318 318 /// 319 ///It addition that itconforms to the320 ///\ref concept::ErasableGraph "ErasableGraph" concept ,319 ///It conforms to the 320 ///\ref concept::ErasableGraph "ErasableGraph" concept and 321 321 ///it also provides several additional useful extra functionalities. 322 322 ///\sa concept::ErasableGraph. … … 331 331 /// Changes the target of \c e to \c n 332 332 /// 333 ///\note The <tt>Edge</tt> 's and <tt>OutEdge</tt>'s333 ///\note The <tt>Edge</tt>s and <tt>OutEdge</tt>s 334 334 ///referencing the changed edge remain 335 ///valid. However <tt>InEdge</tt> 's are invalidated.335 ///valid. However <tt>InEdge</tt>s are invalidated. 336 336 void changeTarget(Edge e, Node n) { 337 337 _changeTarget(e,n); … … 341 341 /// Changes the source of \c e to \c n 342 342 /// 343 ///\note The <tt>Edge</tt> 's and <tt>InEdge</tt>'s343 ///\note The <tt>Edge</tt>s and <tt>InEdge</tt>s 344 344 ///referencing the changed edge remain 345 ///valid. However <tt>OutEdge</tt> 's are invalidated.345 ///valid. However <tt>OutEdge</tt>s are invalidated. 346 346 void changeSource(Edge e, Node n) { 347 347 _changeSource(e,n); … … 350 350 /// Invert the direction of an edge. 351 351 352 ///\note The <tt>Edge</tt> 's352 ///\note The <tt>Edge</tt>s 353 353 ///referencing the changed edge remain 354 ///valid. However <tt>OutEdge</tt> 's and <tt>InEdge</tt>'s are invalidated.354 ///valid. However <tt>OutEdge</tt>s and <tt>InEdge</tt>s are invalidated. 355 355 void reverseEdge(Edge e) { 356 356 Node t=target(e); … … 359 359 } 360 360 361 ///Using this it possible to avoid the superfluous memory allocation.362 363 ///Using this it possible to avoid the superfluous memory allocation.361 ///Using this it is possible to avoid the superfluous memory allocation. 362 363 ///Using this it is possible to avoid the superfluous memory allocation. 364 364 ///\todo more docs... 365 365 void reserveEdge(int n) { edges.reserve(n); }; … … 370 370 /// 371 371 ///Node \p b will be removed but instead of deleting 372 ///i ts neighboringedges, they will be joined to \p a.372 ///incident edges, they will be joined to \p a. 373 373 ///The last parameter \p r controls whether to remove loops. \c true 374 374 ///means that loops will be removed. … … 376 376 ///\note The <tt>Edge</tt>s 377 377 ///referencing a moved edge remain 378 ///valid. However <tt>InEdge</tt> 's and <tt>OutEdge</tt>'s378 ///valid. However <tt>InEdge</tt>s and <tt>OutEdge</tt>s 379 379 ///may be invalidated. 380 380 void contract(Node a, Node b, bool r = true) … … 407 407 ///\note The <tt>Edge</tt>s 408 408 ///referencing a moved edge remain 409 ///valid. However <tt>InEdge</tt> 's and <tt>OutEdge</tt>'s409 ///valid. However <tt>InEdge</tt>s and <tt>OutEdge</tt>s 410 410 ///may be invalidated. 411 411 ///\warning This functionality cannot be used together with the Snapshot … … 427 427 ///Split an edge. 428 428 429 ///This function splits an edge. First a new node \c b is added to the graph,430 ///the n the original edge is retargetes to \c b. Finally an edge431 /// from \c b to the original target is added.432 ///\return The newly created node. 433 ///\warning This functionality cannot be used together with the Snapshot434 /// feature.429 ///This function splits an edge. First a new node \c b is added to 430 ///the graph, then the original edge is retargeted to \c 431 ///b. Finally an edge from \c b to the original target is added. 432 ///\return The newly created node. 433 ///\warning This functionality 434 ///cannot be used together with the Snapshot feature. 435 435 Node split(Edge e) 436 436 { … … 441 441 } 442 442 443 ///Class to make a snapshot of the graph and to rest rore toit later.444 445 ///Class to make a snapshot of the graph and to rest rore toit later.443 ///Class to make a snapshot of the graph and to restore it later. 444 445 ///Class to make a snapshot of the graph and to restore it later. 446 446 /// 447 447 ///The newly added nodes and edges can be removed using the
Note: See TracChangeset
for help on using the changeset viewer.