# Changeset 2006:00d59f733817 in lemon-0.x

Ignore:
Timestamp:
03/15/06 10:44:17 (14 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2621
Message:

Spellcheck

Files:
7 edited

Unmodified
Removed
• ## doc/groups.dox

 r1996 operations, these together satisfy the everyday requirements. In the case of graph strutures, different operations are needed which do not alter the physical graph, but gives an other view. If some nodes or not alter the physical graph, but gives another view. If some nodes or edges have to be hidden or the reverse oriented graph have to be used, then this is the case. It also may happen that in a flow implemenation the residual graph can be accessed by an other algorithm, or a node-set is to be shrunk for an other algorithm. the residual graph can be accessed by another algorithm, or a node-set is to be shrunk for another algorithm. LEMON also provides a variety of graphs for these requirements called \ref graph_adaptors "graph adaptors". Adaptors cannot be used alone but only
• ## lemon/bits/alteration_notifier.h

 r1999 /// edges. If we want to check on every indicing if the map contains /// the current indicing key that cause a drawback in the performance /// in the library. We use an other solution we notify all maps about /// in the library. We use another solution we notify all maps about /// an alteration in the graph, which cause only drawback on the /// alteration of the graph.
• ## lemon/graph_utils.h

 r2002 /// \brief Class to copy a graph. /// /// Class to copy a graph to an other graph (duplicate a graph). The /// Class to copy a graph to another graph (duplicate a graph). The /// simplest way of using it is through the \c copyGraph() function. template }; /// \brief Copy a graph to an other graph. /// /// Copy a graph to an other graph. /// \brief Copy a graph to another graph. /// /// Copy a graph to another graph. /// The usage of the function: /// /// \brief Class to copy an undirected graph. /// /// Class to copy an undirected graph to an other graph (duplicate a graph). /// Class to copy an undirected graph to another graph (duplicate a graph). /// The simplest way of using it is through the \c copyUGraph() function. template }; /// \brief Copy a graph to an other graph. /// /// Copy a graph to an other graph. /// \brief Copy a graph to another graph. /// /// Copy a graph to another graph. /// The usage of the function: ///
• ## lemon/sub_graph.h

 r1990 /// \ingroup semi_adaptors /// /// \brief Graph which uses a subset of an other graph's nodes and edges. /// \brief Graph which uses a subset of another graph's nodes and edges. /// /// Graph which uses a subset of an other graph's nodes and edges. This class /// Graph which uses a subset of another graph's nodes and edges. This class /// is an alternative to the SubGraphAdaptor which is created for the /// same reason. The main difference between the two class that it /// \ingroup semi_adaptors /// /// \brief Graph which uses a subset of an other graph's edges. /// \brief Graph which uses a subset of another graph's edges. /// /// Graph which uses a subset of an other graph's edges. This class /// Graph which uses a subset of another graph's edges. This class /// is an alternative to the EdgeSubGraphAdaptor which is created for the /// same reason. The main difference between the two class that it
• ## lemon/unionfind.h

 r2004 /** * \brief Moves the given element to an other component. * \brief Moves the given element to another component. * * This method moves the element \e a from its component
• ## lemon/xy.h

 r1999 //       } ///Increments a bounding box with an other bounding box ///Increments a bounding box with another bounding box BoundingBox& add(const BoundingBox &u){ if ( !u.empty() ){
• ## test/xy_test.cc

 r1956 doboz2.add(doboz1); check(doboz2.inside(seged), "It should be inside. Incremented a box with an other."); "It should be inside. Incremented a box with another one."); }
Note: See TracChangeset for help on using the changeset viewer.