diff -r e5c0c5cc477f -r 17eb3eaad9f8 lemon/concept/ugraph.h
--- a/lemon/concept/ugraph.h	Thu Feb 02 17:09:09 2006 +0000
+++ b/lemon/concept/ugraph.h	Thu Feb 02 17:43:24 2006 +0000
@@ -304,10 +304,10 @@
       /// This iterator goes through each node.
       /// Its usage is quite simple, for example you can count the number
       /// of nodes in graph \c g of type \c Graph like this:
-      /// \code
+      ///\code
       /// int count=0;
       /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
-      /// \endcode
+      ///\endcode
       class NodeIt : public Node {
       public:
         /// Default constructor
@@ -395,10 +395,10 @@
       /// This iterator goes through each undirected edge of a graph.
       /// Its usage is quite simple, for example you can count the number
       /// of undirected edges in a graph \c g of type \c Graph as follows:
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
       class UEdgeIt : public UEdge {
       public:
         /// Default constructor
@@ -443,10 +443,10 @@
       /// degree (i.e. count the number
       /// of incident edges of a node \c n
       /// in graph \c g of type \c Graph as follows.
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
       class IncEdgeIt : public UEdge {
       public:
         /// Default constructor
@@ -532,10 +532,10 @@
       /// This iterator goes through each edge of a graph.
       /// Its usage is quite simple, for example you can count the number
       /// of edges in a graph \c g of type \c Graph as follows:
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
       class EdgeIt : public Edge {
       public:
         /// Default constructor
@@ -577,10 +577,10 @@
       /// Its usage is quite simple, for example you can count the number
       /// of outgoing edges of a node \c n
       /// in graph \c g of type \c Graph as follows.
-      /// \code
+      ///\code
       /// int count=0;
       /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
     
       class OutEdgeIt : public Edge {
       public:
@@ -629,10 +629,10 @@
       /// Its usage is quite simple, for example you can count the number
       /// of outgoing edges of a node \c n
       /// in graph \c g of type \c Graph as follows.
-      /// \code
+      ///\code
       /// int count=0;
       /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
-      /// \endcode
+      ///\endcode
 
       class InEdgeIt : public Edge {
       public: