1.1 --- a/doc/groups.dox Fri Mar 10 19:34:47 2006 +0000
1.2 +++ b/doc/groups.dox Wed Mar 15 09:44:17 2006 +0000
1.3 @@ -25,11 +25,11 @@
1.4 Alteration of standard containers need a very limited number of
1.5 operations, these together satisfy the everyday requirements.
1.6 In the case of graph strutures, different operations are needed which do
1.7 -not alter the physical graph, but gives an other view. If some nodes or
1.8 +not alter the physical graph, but gives another view. If some nodes or
1.9 edges have to be hidden or the reverse oriented graph have to be used, then
1.10 this is the case. It also may happen that in a flow implemenation
1.11 -the residual graph can be accessed by an other algorithm, or a node-set
1.12 -is to be shrunk for an other algorithm.
1.13 +the residual graph can be accessed by another algorithm, or a node-set
1.14 +is to be shrunk for another algorithm.
1.15 LEMON also provides a variety of graphs for these requirements called
1.16 \ref graph_adaptors "graph adaptors". Adaptors cannot be used alone but only
1.17 in conjunction with other graph representation.
2.1 --- a/lemon/bits/alteration_notifier.h Fri Mar 10 19:34:47 2006 +0000
2.2 +++ b/lemon/bits/alteration_notifier.h Wed Mar 15 09:44:17 2006 +0000
2.3 @@ -44,7 +44,7 @@
2.4 /// that the node and edge maps should contain values for all nodes or
2.5 /// edges. If we want to check on every indicing if the map contains
2.6 /// the current indicing key that cause a drawback in the performance
2.7 - /// in the library. We use an other solution we notify all maps about
2.8 + /// in the library. We use another solution we notify all maps about
2.9 /// an alteration in the graph, which cause only drawback on the
2.10 /// alteration of the graph.
2.11 ///
3.1 --- a/lemon/graph_utils.h Fri Mar 10 19:34:47 2006 +0000
3.2 +++ b/lemon/graph_utils.h Wed Mar 15 09:44:17 2006 +0000
3.3 @@ -456,7 +456,7 @@
3.4
3.5 /// \brief Class to copy a graph.
3.6 ///
3.7 - /// Class to copy a graph to an other graph (duplicate a graph). The
3.8 + /// Class to copy a graph to another graph (duplicate a graph). The
3.9 /// simplest way of using it is through the \c copyGraph() function.
3.10 template <typename Target, typename Source>
3.11 class GraphCopy {
3.12 @@ -579,9 +579,9 @@
3.13 EdgeRefMap edgeRefMap;
3.14 };
3.15
3.16 - /// \brief Copy a graph to an other graph.
3.17 + /// \brief Copy a graph to another graph.
3.18 ///
3.19 - /// Copy a graph to an other graph.
3.20 + /// Copy a graph to another graph.
3.21 /// The usage of the function:
3.22 ///
3.23 ///\code
3.24 @@ -599,7 +599,7 @@
3.25
3.26 /// \brief Class to copy an undirected graph.
3.27 ///
3.28 - /// Class to copy an undirected graph to an other graph (duplicate a graph).
3.29 + /// Class to copy an undirected graph to another graph (duplicate a graph).
3.30 /// The simplest way of using it is through the \c copyUGraph() function.
3.31 template <typename Target, typename Source>
3.32 class UGraphCopy {
3.33 @@ -791,9 +791,9 @@
3.34 UEdgeRefMap uEdgeRefMap;
3.35 };
3.36
3.37 - /// \brief Copy a graph to an other graph.
3.38 + /// \brief Copy a graph to another graph.
3.39 ///
3.40 - /// Copy a graph to an other graph.
3.41 + /// Copy a graph to another graph.
3.42 /// The usage of the function:
3.43 ///
3.44 ///\code
4.1 --- a/lemon/sub_graph.h Fri Mar 10 19:34:47 2006 +0000
4.2 +++ b/lemon/sub_graph.h Wed Mar 15 09:44:17 2006 +0000
4.3 @@ -373,9 +373,9 @@
4.4
4.5 /// \ingroup semi_adaptors
4.6 ///
4.7 - /// \brief Graph which uses a subset of an other graph's nodes and edges.
4.8 + /// \brief Graph which uses a subset of another graph's nodes and edges.
4.9 ///
4.10 - /// Graph which uses a subset of an other graph's nodes and edges. This class
4.11 + /// Graph which uses a subset of another graph's nodes and edges. This class
4.12 /// is an alternative to the SubGraphAdaptor which is created for the
4.13 /// same reason. The main difference between the two class that it
4.14 /// makes linked lists on the unhidden nodes and edges what cause that
4.15 @@ -670,9 +670,9 @@
4.16
4.17 /// \ingroup semi_adaptors
4.18 ///
4.19 - /// \brief Graph which uses a subset of an other graph's edges.
4.20 + /// \brief Graph which uses a subset of another graph's edges.
4.21 ///
4.22 - /// Graph which uses a subset of an other graph's edges. This class
4.23 + /// Graph which uses a subset of another graph's edges. This class
4.24 /// is an alternative to the EdgeSubGraphAdaptor which is created for the
4.25 /// same reason. The main difference between the two class that it
4.26 /// makes linked lists on the unhidden edges what cause that
5.1 --- a/lemon/unionfind.h Fri Mar 10 19:34:47 2006 +0000
5.2 +++ b/lemon/unionfind.h Wed Mar 15 09:44:17 2006 +0000
5.3 @@ -429,7 +429,7 @@
5.4 }
5.5
5.6 /**
5.7 - * \brief Moves the given element to an other component.
5.8 + * \brief Moves the given element to another component.
5.9 *
5.10 * This method moves the element \e a from its component
5.11 * to the component of \e comp.
6.1 --- a/lemon/xy.h Fri Mar 10 19:34:47 2006 +0000
6.2 +++ b/lemon/xy.h Wed Mar 15 09:44:17 2006 +0000
6.3 @@ -400,7 +400,7 @@
6.4 // return b += u;
6.5 // }
6.6
6.7 - ///Increments a bounding box with an other bounding box
6.8 + ///Increments a bounding box with another bounding box
6.9 BoundingBox& add(const BoundingBox &u){
6.10 if ( !u.empty() ){
6.11 this->add(u.bottomLeft());
7.1 --- a/test/xy_test.cc Fri Mar 10 19:34:47 2006 +0000
7.2 +++ b/test/xy_test.cc Wed Mar 15 09:44:17 2006 +0000
7.3 @@ -78,5 +78,5 @@
7.4
7.5 doboz2.add(doboz1);
7.6 check(doboz2.inside(seged),
7.7 - "It should be inside. Incremented a box with an other.");
7.8 + "It should be inside. Incremented a box with another one.");
7.9 }