COIN-OR::LEMON - Graph Library

Changeset 2006:00d59f733817 in lemon-0.x


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

Spellcheck

Files:
7 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

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

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

    r2002 r2006  
    457457  /// \brief Class to copy a graph.
    458458  ///
    459   /// Class to copy a graph to an other graph (duplicate a graph). The
     459  /// Class to copy a graph to another graph (duplicate a graph). The
    460460  /// simplest way of using it is through the \c copyGraph() function.
    461461  template <typename Target, typename Source>
     
    580580  };
    581581
    582   /// \brief Copy a graph to an other graph.
    583   ///
    584   /// Copy a graph to an other graph.
     582  /// \brief Copy a graph to another graph.
     583  ///
     584  /// Copy a graph to another graph.
    585585  /// The usage of the function:
    586586  ///
     
    600600  /// \brief Class to copy an undirected graph.
    601601  ///
    602   /// Class to copy an undirected graph to an other graph (duplicate a graph).
     602  /// Class to copy an undirected graph to another graph (duplicate a graph).
    603603  /// The simplest way of using it is through the \c copyUGraph() function.
    604604  template <typename Target, typename Source>
     
    792792  };
    793793
    794   /// \brief Copy a graph to an other graph.
    795   ///
    796   /// Copy a graph to an other graph.
     794  /// \brief Copy a graph to another graph.
     795  ///
     796  /// Copy a graph to another graph.
    797797  /// The usage of the function:
    798798  ///
  • lemon/sub_graph.h

    r1990 r2006  
    374374  /// \ingroup semi_adaptors
    375375  ///
    376   /// \brief Graph which uses a subset of an other graph's nodes and edges.
     376  /// \brief Graph which uses a subset of another graph's nodes and edges.
    377377  ///
    378   /// Graph which uses a subset of an other graph's nodes and edges. This class
     378  /// Graph which uses a subset of another graph's nodes and edges. This class
    379379  /// is an alternative to the SubGraphAdaptor which is created for the
    380380  /// same reason. The main difference between the two class that it
     
    671671  /// \ingroup semi_adaptors
    672672  ///
    673   /// \brief Graph which uses a subset of an other graph's edges.
     673  /// \brief Graph which uses a subset of another graph's edges.
    674674  ///
    675   /// Graph which uses a subset of an other graph's edges. This class
     675  /// Graph which uses a subset of another graph's edges. This class
    676676  /// is an alternative to the EdgeSubGraphAdaptor which is created for the
    677677  /// same reason. The main difference between the two class that it
  • lemon/unionfind.h

    r2004 r2006  
    430430
    431431    /**
    432      * \brief Moves the given element to an other component.
     432     * \brief Moves the given element to another component.
    433433     *
    434434     * This method moves the element \e a from its component
  • lemon/xy.h

    r1999 r2006  
    401401//       }
    402402
    403       ///Increments a bounding box with an other bounding box
     403      ///Increments a bounding box with another bounding box
    404404      BoundingBox& add(const BoundingBox &u){
    405405        if ( !u.empty() ){
  • test/xy_test.cc

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