Changeset 2006:00d59f733817 in lemon0.x for lemon
 Timestamp:
 03/15/06 10:44:17 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2621
 Location:
 lemon
 Files:

 5 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bits/alteration_notifier.h
r1999 r2006 45 45 /// edges. If we want to check on every indicing if the map contains 46 46 /// the current indicing key that cause a drawback in the performance 47 /// in the library. We use an 47 /// in the library. We use another solution we notify all maps about 48 48 /// an alteration in the graph, which cause only drawback on the 49 49 /// alteration of the graph. 
lemon/graph_utils.h
r2002 r2006 457 457 /// \brief Class to copy a graph. 458 458 /// 459 /// Class to copy a graph to an 459 /// Class to copy a graph to another graph (duplicate a graph). The 460 460 /// simplest way of using it is through the \c copyGraph() function. 461 461 template <typename Target, typename Source> … … 580 580 }; 581 581 582 /// \brief Copy a graph to an 583 /// 584 /// Copy a graph to an 582 /// \brief Copy a graph to another graph. 583 /// 584 /// Copy a graph to another graph. 585 585 /// The usage of the function: 586 586 /// … … 600 600 /// \brief Class to copy an undirected graph. 601 601 /// 602 /// Class to copy an undirected graph to an 602 /// Class to copy an undirected graph to another graph (duplicate a graph). 603 603 /// The simplest way of using it is through the \c copyUGraph() function. 604 604 template <typename Target, typename Source> … … 792 792 }; 793 793 794 /// \brief Copy a graph to an 795 /// 796 /// Copy a graph to an 794 /// \brief Copy a graph to another graph. 795 /// 796 /// Copy a graph to another graph. 797 797 /// The usage of the function: 798 798 /// 
lemon/sub_graph.h
r1990 r2006 374 374 /// \ingroup semi_adaptors 375 375 /// 376 /// \brief Graph which uses a subset of an 376 /// \brief Graph which uses a subset of another graph's nodes and edges. 377 377 /// 378 /// Graph which uses a subset of an 378 /// Graph which uses a subset of another graph's nodes and edges. This class 379 379 /// is an alternative to the SubGraphAdaptor which is created for the 380 380 /// same reason. The main difference between the two class that it … … 671 671 /// \ingroup semi_adaptors 672 672 /// 673 /// \brief Graph which uses a subset of an 673 /// \brief Graph which uses a subset of another graph's edges. 674 674 /// 675 /// Graph which uses a subset of an 675 /// Graph which uses a subset of another graph's edges. This class 676 676 /// is an alternative to the EdgeSubGraphAdaptor which is created for the 677 677 /// same reason. The main difference between the two class that it 
lemon/unionfind.h
r2004 r2006 430 430 431 431 /** 432 * \brief Moves the given element to an 432 * \brief Moves the given element to another component. 433 433 * 434 434 * This method moves the element \e a from its component 
lemon/xy.h
r1999 r2006 401 401 // } 402 402 403 ///Increments a bounding box with an 403 ///Increments a bounding box with another bounding box 404 404 BoundingBox& add(const BoundingBox &u){ 405 405 if ( !u.empty() ){
Note: See TracChangeset
for help on using the changeset viewer.