Changeset 2408:467ca6d16556 in lemon-0.x for doc/maps1.dox

Timestamp:

03/13/07 16:42:06 (17 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Doc improvements contributed by Peter Kovacs.

File:

• doc/maps1.dox (modified) (2 diffs)

doc/maps1.dox

@@ -35 +35 @@
 To make easy to use them - especially as template parameters - there are <i>map concepts</i> like by graph classes.
 <ul>
-<li>\ref ReadMap - values can be red out with the \c operator[].
+<li>\ref ReadMap - values can be read out with the \c operator[].
 \code value_typed_variable = map_instance[key_value]; \endcode
 </li>
@@ -60 +60 @@
 type. As an example, think of a edge-weighted directed graph.
 \code ListGraph::EdgeMap<int>  weight(graph); \endcode
-You can see that the map needs the graph hows edges will mapped, but nothing more.
+You can see that the map needs the graph whose edges will mapped, but nothing more.
 
 If the graph class is extendable or erasable the map will automatically follow