1.1 --- a/adaptors.dox	Mon Mar 01 02:28:05 2010 +0100
     1.2 +++ b/adaptors.dox	Mon Mar 01 02:28:44 2010 +0100
     1.3 @@ -25,7 +25,7 @@
     1.4  has to be considered.
     1.5  If some nodes or arcs have to be hidden (maybe temporarily) or the reverse
     1.6  oriented graph has to be used, then this is the case.
     1.7 -However, actually modifing physical storage of the graph or
     1.8 +However, actually modifying physical storage of the graph or
     1.9  making a copy of the graph structure along with the required maps
    1.10  could be rather expensive (in time or in memory usage) compared to the
    1.11  operations that should be performed on the altered graph.
    1.12 @@ -61,7 +61,7 @@
    1.13  code, and makes it possible to easily implement complex algorithms based on
    1.14  well tested standard components.
    1.15  
    1.16 -For solving the problem introduced above, we could use the follwing code.
    1.17 +For solving the problem introduced above, we could use the following code.
    1.18  
    1.19  \code
    1.20    ListDigraph g;