# HG changeset patch
# User alpar
# Date 1138987281 0
# Node ID 3efb110919fa7aff7f0e4eada5ab65ca8bdead8e
# Parent  a055123339d53762ba55c5c8e89c66fb2ff138a4
Last struggle against Doxygen.

diff -r a055123339d5 -r 3efb110919fa lemon/graph_adaptor.h
--- a/lemon/graph_adaptor.h	Fri Feb 03 16:40:16 2006 +0000
+++ b/lemon/graph_adaptor.h	Fri Feb 03 17:21:21 2006 +0000
@@ -460,7 +460,7 @@
   /// This way the edge-map
   /// should filter all edges which's source or target is filtered by the 
   /// node-filter.
-  /// \code
+  ///\code
   /// typedef ListGraph Graph;
   /// Graph g;
   /// typedef Graph::Node Node;
@@ -478,13 +478,13 @@
   /// for (SubGW::NodeIt n(gw); n!=INVALID; ++n) std::cout << g.id(n) << std::endl;
   /// std::cout << ":-)" << std::endl;
   /// for (SubGW::EdgeIt e(gw); e!=INVALID; ++e) std::cout << g.id(e) << std::endl;
-  /// \endcode
+  ///\endcode
   /// The output of the above code is the following.
-  /// \code
+  ///\code
   /// 1
   /// :-)
   /// 1
-  /// \endcode
+  ///\endcode
   /// Note that \c n is of type \c SubGW::NodeIt, but it can be converted to
   /// \c Graph::Node that is why \c g.id(n) can be applied.
   ///