1.1 --- a/lemon/bits/alteration_notifier.h	Mon Jul 28 09:29:30 2008 +0200
     1.2 +++ b/lemon/bits/alteration_notifier.h	Mon Jul 28 12:39:58 2008 +0100
     1.3 @@ -41,7 +41,7 @@
     1.4    /// value containers which are the node and edge maps.
     1.5    ///
     1.6    /// The graph's node and edge sets can be changed as we add or erase
     1.7 -  /// nodes and edges in the graph. Lemon would like to handle easily
     1.8 +  /// nodes and edges in the graph. LEMON would like to handle easily
     1.9    /// that the node and edge maps should contain values for all nodes or
    1.10    /// edges. If we want to check on every indicing if the map contains
    1.11    /// the current indicing key that cause a drawback in the performance