1.1 --- a/lemon/graph_adaptor.h	Fri Feb 03 16:40:16 2006 +0000
     1.2 +++ b/lemon/graph_adaptor.h	Fri Feb 03 17:21:21 2006 +0000
     1.3 @@ -460,7 +460,7 @@
     1.4    /// This way the edge-map
     1.5    /// should filter all edges which's source or target is filtered by the 
     1.6    /// node-filter.
     1.7 -  /// \code
     1.8 +  ///\code
     1.9    /// typedef ListGraph Graph;
    1.10    /// Graph g;
    1.11    /// typedef Graph::Node Node;
    1.12 @@ -478,13 +478,13 @@
    1.13    /// for (SubGW::NodeIt n(gw); n!=INVALID; ++n) std::cout << g.id(n) << std::endl;
    1.14    /// std::cout << ":-)" << std::endl;
    1.15    /// for (SubGW::EdgeIt e(gw); e!=INVALID; ++e) std::cout << g.id(e) << std::endl;
    1.16 -  /// \endcode
    1.17 +  ///\endcode
    1.18    /// The output of the above code is the following.
    1.19 -  /// \code
    1.20 +  ///\code
    1.21    /// 1
    1.22    /// :-)
    1.23    /// 1
    1.24 -  /// \endcode
    1.25 +  ///\endcode
    1.26    /// Note that \c n is of type \c SubGW::NodeIt, but it can be converted to
    1.27    /// \c Graph::Node that is why \c g.id(n) can be applied.
    1.28    ///