Changeset 1167:ccbca6ba8b59 in lemon-0.x

Timestamp:

02/22/05 11:23:08 (19 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

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

Message:

Corrected spelling errors.

File:

• doc/maps.dox (modified) (4 diffs)

doc/maps.dox

@@ -4 +4 @@
 \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:
@@ -47 +47 @@
 \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>
@@ -71 +71 @@
 \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
@@ -116 +116 @@
 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)));
   }