1.1 --- a/lemon/grid_graph.h	Thu Feb 02 17:09:09 2006 +0000
     1.2 +++ b/lemon/grid_graph.h	Thu Feb 02 17:43:24 2006 +0000
     1.3 @@ -354,7 +354,7 @@
     1.4    /// on one position and only one is the difference. 
     1.5    ///
     1.6    /// The graph can be indiced in the following way:
     1.7 -  /// \code
     1.8 +  ///\code
     1.9    /// GridGraph graph(w, h);
    1.10    /// GridGraph::NodeMap<int> val(graph); 
    1.11    /// for (int i = 0; i < graph.width(); ++i) {
    1.12 @@ -362,7 +362,7 @@
    1.13    ///     val[graph(i, j)] = i + j;
    1.14    ///   }
    1.15    /// }
    1.16 -  /// \endcode
    1.17 +  ///\endcode
    1.18    ///
    1.19    /// The graph type is fully conform to the \ref concept::UGraph
    1.20    /// "Undirected Graph" concept.