diff -r e5c0c5cc477f -r 17eb3eaad9f8 lemon/graph_utils.h
--- a/lemon/graph_utils.h	Thu Feb 02 17:09:09 2006 +0000
+++ b/lemon/graph_utils.h	Thu Feb 02 17:43:24 2006 +0000
@@ -258,11 +258,11 @@
   /// \return The found edge or \ref INVALID if there is no such an edge.
   ///
   /// Thus you can iterate through each edge from \c u to \c v as it follows.
-  /// \code
+  ///\code
   /// for(Edge e=findEdge(g,u,v);e!=INVALID;e=findEdge(g,u,v,e)) {
   ///   ...
   /// }
-  /// \endcode
+  ///\endcode
   // /// \todo We may want to use the "GraphBase" 
   // /// interface here...
   template <typename Graph>
@@ -278,11 +278,11 @@
   /// Iterator for iterating on edges connected the same nodes. It is 
   /// higher level interface for the findEdge() function. You can
   /// use it the following way:
-  /// \code
+  ///\code
   /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
   ///   ...
   /// }
-  /// \endcode
+  ///\endcode
   ///
   /// \author Balazs Dezso 
   template <typename _Graph>
@@ -360,12 +360,12 @@
   /// \return The found edge or \ref INVALID if there is no such an edge.
   ///
   /// Thus you can iterate through each edge from \c u to \c v as it follows.
-  /// \code
+  ///\code
   /// for(UEdge e = findUEdge(g,u,v); e != INVALID; 
   ///     e = findUEdge(g,u,v,e)) {
   ///   ...
   /// }
-  /// \endcode
+  ///\endcode
   // /// \todo We may want to use the "GraphBase" 
   // /// interface here...
   template <typename Graph>
@@ -382,11 +382,11 @@
   /// Iterator for iterating on uedges connected the same nodes. It is 
   /// higher level interface for the findUEdge() function. You can
   /// use it the following way:
-  /// \code
+  ///\code
   /// for (ConUEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
   ///   ...
   /// }
-  /// \endcode
+  ///\endcode
   ///
   /// \author Balazs Dezso 
   template <typename _Graph>
@@ -580,9 +580,9 @@
   /// Copy a graph to an other graph.
   /// The usage of the function:
   /// 
-  /// \code
+  ///\code
   /// copyGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr);
-  /// \endcode
+  ///\endcode
   /// 
   /// After the copy the \c nr map will contain the mapping from the
   /// source graph's nodes to the target graph's nodes and the \c ecr will
@@ -792,9 +792,9 @@
   /// Copy a graph to an other graph.
   /// The usage of the function:
   /// 
-  /// \code
+  ///\code
   /// copyGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr);
-  /// \endcode
+  ///\endcode
   /// 
   /// After the copy the \c nr map will contain the mapping from the
   /// source graph's nodes to the target graph's nodes and the \c ecr will