Index: doc/groups.dox
===================================================================
--- doc/groups.dox (revision 1996)
+++ doc/groups.dox (revision 2006)
@@ -26,9 +26,9 @@
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