1.1 --- a/doc/maps1.dox	Tue Mar 13 15:35:56 2007 +0000
     1.2 +++ b/doc/maps1.dox	Tue Mar 13 15:42:06 2007 +0000
     1.3 @@ -34,7 +34,7 @@
     1.4  
     1.5  To make easy to use them - especially as template parameters - there are <i>map concepts</i> like by graph classes.
     1.6  <ul>
     1.7 -<li>\ref ReadMap - values can be red out with the \c operator[].
     1.8 +<li>\ref ReadMap - values can be read out with the \c operator[].
     1.9  \code value_typed_variable = map_instance[key_value]; \endcode
    1.10  </li>
    1.11  <li>\ref WriteMap - values can be set with the \c set() member function.
    1.12 @@ -59,7 +59,7 @@
    1.13  If you want to assign data to nodes, just declare a NodeMap with the corresponding
    1.14  type. As an example, think of a edge-weighted directed graph.
    1.15  \code ListGraph::EdgeMap<int>  weight(graph); \endcode
    1.16 -You can see that the map needs the graph hows edges will mapped, but nothing more.
    1.17 +You can see that the map needs the graph whose edges will mapped, but nothing more.
    1.18  
    1.19  If the graph class is extendable or erasable the map will automatically follow
    1.20  the changes you make. If a new node is added a default value is mapped to it.