# HG changeset patch
# User athos
# Date 1109067788 0
# Node ID ccbca6ba8b59669124371a99057827b34e6c440f
# Parent  db3d437560f30656c3c771535c82871dc019716d
Corrected spelling errors.

diff -r db3d437560f3 -r ccbca6ba8b59 doc/maps.dox
--- a/doc/maps.dox	Mon Feb 21 19:03:52 2005 +0000
+++ b/doc/maps.dox	Tue Feb 22 10:23:08 2005 +0000
@@ -3,7 +3,7 @@
 
 \page maps-page Maps
 
-Maps play central role in LEMON. As their name suggests, they map a
+Maps play a central role in LEMON. As their name suggests, they map a
 certain range of \e keys to certain \e values. Each map has two
 <tt>typedef</tt>'s to determine the types of keys and values, like this:
 
@@ -46,7 +46,7 @@
 that converts to \c ListGraph::Edge, like  \c ListGraph::EdgeIt or
 \c ListGraph::OutEdgeIt etc.)
 
-There are two ways the assign a new value to a key
+There are two ways to assign a new value to a key
 
 - In case of a <em>reference map</em> <tt>operator[]</tt>
 gives you a reference to the
@@ -70,8 +70,8 @@
 
 \subsection read-maps Readable Maps
 
-Readable maps are very frequently used as the input of the
-algorithms.  For this purpose the most straightforward way is the use of the
+Readable maps are very frequently used as the input of an
+algorithm.  For this purpose the most straightforward way is the use of the
 default maps provided by LEMON's graph structures.
 Very often however, it is more
 convenient and/or more efficient to write your own readable map.
@@ -115,7 +115,7 @@
   
 public:
   Value operator[](Key e) const {
-    return orig_len.get(e)-pot.get(G.target(e))-pot.get(G.source(e));
+    return orig_len.get(e)-(pot.get(G.target(e))-pot.get(G.source(e)));
   }
   
   ReducedLengthMap(const Graph &_g,