1.1 --- a/lemon/concept/graph.h	Thu Feb 02 17:09:09 2006 +0000
     1.2 +++ b/lemon/concept/graph.h	Thu Feb 02 17:43:24 2006 +0000
     1.3 @@ -192,10 +192,10 @@
     1.4        /// This iterator goes through each node.
     1.5        /// Its usage is quite simple, for example you can count the number
     1.6        /// of nodes in graph \c g of type \c Graph like this:
     1.7 -      /// \code
     1.8 +      ///\code
     1.9        /// int count=0;
    1.10        /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
    1.11 -      /// \endcode
    1.12 +      ///\endcode
    1.13        class NodeIt : public Node {
    1.14        public:
    1.15          /// Default constructor
    1.16 @@ -285,10 +285,10 @@
    1.17        /// Its usage is quite simple, for example you can count the number
    1.18        /// of outgoing edges of a node \c n
    1.19        /// in graph \c g of type \c Graph as follows.
    1.20 -      /// \code
    1.21 +      ///\code
    1.22        /// int count=0;
    1.23        /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    1.24 -      /// \endcode
    1.25 +      ///\endcode
    1.26      
    1.27        class OutEdgeIt : public Edge {
    1.28        public:
    1.29 @@ -332,10 +332,10 @@
    1.30        /// Its usage is quite simple, for example you can count the number
    1.31        /// of outgoing edges of a node \c n
    1.32        /// in graph \c g of type \c Graph as follows.
    1.33 -      /// \code
    1.34 +      ///\code
    1.35        /// int count=0;
    1.36        /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    1.37 -      /// \endcode
    1.38 +      ///\endcode
    1.39  
    1.40        class InEdgeIt : public Edge {
    1.41        public:
    1.42 @@ -376,10 +376,10 @@
    1.43        /// This iterator goes through each edge of a graph.
    1.44        /// Its usage is quite simple, for example you can count the number
    1.45        /// of edges in a graph \c g of type \c Graph as follows:
    1.46 -      /// \code
    1.47 +      ///\code
    1.48        /// int count=0;
    1.49        /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
    1.50 -      /// \endcode
    1.51 +      ///\endcode
    1.52        class EdgeIt : public Edge {
    1.53        public:
    1.54          /// Default constructor