1.1 --- a/doc/maps.dox	Mon Feb 21 19:03:52 2005 +0000
     1.2 +++ b/doc/maps.dox	Tue Feb 22 10:23:08 2005 +0000
     1.3 @@ -3,7 +3,7 @@
     1.4  
     1.5  \page maps-page Maps
     1.6  
     1.7 -Maps play central role in LEMON. As their name suggests, they map a
     1.8 +Maps play a central role in LEMON. As their name suggests, they map a
     1.9  certain range of \e keys to certain \e values. Each map has two
    1.10  <tt>typedef</tt>'s to determine the types of keys and values, like this:
    1.11  
    1.12 @@ -46,7 +46,7 @@
    1.13  that converts to \c ListGraph::Edge, like  \c ListGraph::EdgeIt or
    1.14  \c ListGraph::OutEdgeIt etc.)
    1.15  
    1.16 -There are two ways the assign a new value to a key
    1.17 +There are two ways to assign a new value to a key
    1.18  
    1.19  - In case of a <em>reference map</em> <tt>operator[]</tt>
    1.20  gives you a reference to the
    1.21 @@ -70,8 +70,8 @@
    1.22  
    1.23  \subsection read-maps Readable Maps
    1.24  
    1.25 -Readable maps are very frequently used as the input of the
    1.26 -algorithms.  For this purpose the most straightforward way is the use of the
    1.27 +Readable maps are very frequently used as the input of an
    1.28 +algorithm.  For this purpose the most straightforward way is the use of the
    1.29  default maps provided by LEMON's graph structures.
    1.30  Very often however, it is more
    1.31  convenient and/or more efficient to write your own readable map.
    1.32 @@ -115,7 +115,7 @@
    1.33    
    1.34  public:
    1.35    Value operator[](Key e) const {
    1.36 -    return orig_len.get(e)-pot.get(G.target(e))-pot.get(G.source(e));
    1.37 +    return orig_len.get(e)-(pot.get(G.target(e))-pot.get(G.source(e)));
    1.38    }
    1.39    
    1.40    ReducedLengthMap(const Graph &_g,