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

Timestamp:

03/15/06 10:44:17 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2621

Message:

Spellcheck

Location:

lemon

Files:

• bits/alteration_notifier.h (modified) (1 diff)
• graph_utils.h (modified) (4 diffs)
• sub_graph.h (modified) (2 diffs)
• unionfind.h (modified) (1 diff)
• xy.h (modified) (1 diff)

lemon/bits/alteration_notifier.h

@@ -45 +45 @@
   /// 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

@@ -457 +457 @@
   /// \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 <typename Target, typename Source>
@@ -580 +580 @@
   };
 
-  /// \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:
   /// 
@@ -600 +600 @@
   /// \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 <typename Target, typename Source>
@@ -792 +792 @@
   };
 
-  /// \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

@@ -374 +374 @@
   /// \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
@@ -671 +671 @@
   /// \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

@@ -430 +430 @@
 
     /**
-     * \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

@@ -401 +401 @@
 //       }
 
-      ///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() ){