1.1 --- a/doc/graph_io.dox	Wed May 31 16:48:31 2006 +0000
     1.2 +++ b/doc/graph_io.dox	Tue Jun 06 12:47:01 2006 +0000
     1.3 @@ -197,7 +197,7 @@
     1.4  but the reading method does not depend on the order of the
     1.5  given commands.
     1.6  
     1.7 -The reader object assumes that each not readed value does not contain 
     1.8 +The reader object assumes that each not read value does not contain 
     1.9  whitespaces, therefore it has some extra possibilities to control how
    1.10  it should skip the values when the string representation contains spaces.
    1.11  
    1.12 @@ -271,7 +271,7 @@
    1.13  the \ref lemon::GraphReader "GraphReader"
    1.14  should know how to read a Value from the given map.
    1.15  By the default implementation the input operator reads a value from
    1.16 -the stream and the type of the readed value is the value type of the given map.
    1.17 +the stream and the type of the read value is the value type of the given map.
    1.18  When the reader should skip a value in the stream, because you do not
    1.19  want to store it in a map, the reader skips a character sequence without 
    1.20  whitespaces. 

     2.1 --- a/lemon/graph_reader.h	Wed May 31 16:48:31 2006 +0000
     2.2 +++ b/lemon/graph_reader.h	Tue Jun 06 12:47:01 2006 +0000
     2.3 @@ -48,7 +48,7 @@
     2.4    /// given commands (i.e. you don't have to insist on the order in which the
     2.5    /// maps are given in the file).
     2.6    ///
     2.7 -  /// The reader object assumes that not readed values do not contain 
     2.8 +  /// The reader object assumes that not read values do not contain 
     2.9    /// whitespaces, therefore it has some extra possibilities to control how
    2.10    /// it should skip the values when the string representation contains spaces.
    2.11    ///
    2.12 @@ -388,7 +388,7 @@
    2.13    /// to the UGraphWriter but the reading method does not depend on the
    2.14    /// order of the given commands.
    2.15    ///
    2.16 -  /// The reader object suppose that each not readed value does not contain 
    2.17 +  /// The reader object suppose that each not read value does not contain 
    2.18    /// whitespaces, therefore it has some extra possibilities to control how
    2.19    /// it should skip the values when the string representation contains spaces.
    2.20    ///

     3.1 --- a/lemon/lemon_reader.h	Wed May 31 16:48:31 2006 +0000
     3.2 +++ b/lemon/lemon_reader.h	Tue Jun 06 12:47:01 2006 +0000
     3.3 @@ -767,7 +767,7 @@
     3.4      ///
     3.5      /// Constructor for NodeSetReader. It creates the NodeSetReader and
     3.6      /// attach it into the given LemonReader. The nodeset reader will
     3.7 -    /// add the readed nodes to the given Graph. The reader will read
     3.8 +    /// add the read nodes to the given Graph. The reader will read
     3.9      /// the section when the \c section_name and the \c _name are the same. 
    3.10      NodeSetReader(LemonReader& _reader, 
    3.11  		  Graph& _graph, 
    3.12 @@ -991,7 +991,7 @@
    3.13      ///
    3.14      /// Constructor for EdgeSetReader. It creates the EdgeSetReader and
    3.15      /// attach it into the given LemonReader. The edgeset reader will
    3.16 -    /// add the readed edges to the given Graph. It will use the given
    3.17 +    /// add the read edges to the given Graph. It will use the given
    3.18      /// node id reader to read the source and target nodes of the edges.
    3.19      /// The reader will read the section only if the \c _name and the 
    3.20      /// \c edgset_name are the same. 
    3.21 @@ -1235,7 +1235,7 @@
    3.22      ///
    3.23      /// Constructor for UEdgeSetReader. It creates the UEdgeSetReader 
    3.24      /// and attach it into the given LemonReader. The undirected edgeset 
    3.25 -    /// reader will add the readed undirected edges to the given Graph. It 
    3.26 +    /// reader will add the read undirected edges to the given Graph. It 
    3.27      /// will use the given node id reader to read the source and target 
    3.28      /// nodes of the edges. The reader will read the section only if the 
    3.29      /// \c _name and the \c uedgset_name are the same.