Index: lemon/concept/bpugraph.h
===================================================================
--- lemon/concept/bpugraph.h	(revision 1933)
+++ lemon/concept/bpugraph.h	(revision 1946)
@@ -245,8 +245,8 @@
       /// 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:
@@ -290,8 +290,8 @@
       /// 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::ANodeIt n(g); n!=INVALID; ++n) ++count;
-      /// \endcode
+      ///\endcode
       class ANodeIt : public ANode {
       public:
@@ -335,8 +335,8 @@
       /// 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::BNodeIt n(g); n!=INVALID; ++n) ++count;
-      /// \endcode
+      ///\endcode
       class BNodeIt : public BNode {
       public:
@@ -426,8 +426,8 @@
       /// 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:
@@ -474,8 +474,8 @@
       /// 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:
@@ -563,8 +563,8 @@
       /// 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:
@@ -608,8 +608,8 @@
       /// 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 {
@@ -660,8 +660,8 @@
       /// 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 {
Index: lemon/concept/graph.h
===================================================================
--- lemon/concept/graph.h	(revision 1909)
+++ lemon/concept/graph.h	(revision 1946)
@@ -193,8 +193,8 @@
       /// 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:
@@ -286,8 +286,8 @@
       /// 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 {
@@ -333,8 +333,8 @@
       /// 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 {
@@ -377,8 +377,8 @@
       /// 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:
Index: lemon/concept/ugraph.h
===================================================================
--- lemon/concept/ugraph.h	(revision 1910)
+++ lemon/concept/ugraph.h	(revision 1946)
@@ -305,8 +305,8 @@
       /// 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:
@@ -396,8 +396,8 @@
       /// 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:
@@ -444,8 +444,8 @@
       /// 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:
@@ -533,8 +533,8 @@
       /// 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:
@@ -578,8 +578,8 @@
       /// 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 {
@@ -630,8 +630,8 @@
       /// 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 {
