1.1 --- a/lemon/concept/ugraph.h	Thu Feb 02 17:09:09 2006 +0000
     1.2 +++ b/lemon/concept/ugraph.h	Thu Feb 02 17:43:24 2006 +0000
     1.3 @@ -304,10 +304,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 @@ -395,10 +395,10 @@
    1.17        /// This iterator goes through each undirected edge of a graph.
    1.18        /// Its usage is quite simple, for example you can count the number
    1.19        /// of undirected edges in a graph \c g of type \c Graph as follows:
    1.20 -      /// \code
    1.21 +      ///\code
    1.22        /// int count=0;
    1.23        /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count;
    1.24 -      /// \endcode
    1.25 +      ///\endcode
    1.26        class UEdgeIt : public UEdge {
    1.27        public:
    1.28          /// Default constructor
    1.29 @@ -443,10 +443,10 @@
    1.30        /// degree (i.e. count the number
    1.31        /// of incident 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::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    1.37 -      /// \endcode
    1.38 +      ///\endcode
    1.39        class IncEdgeIt : public UEdge {
    1.40        public:
    1.41          /// Default constructor
    1.42 @@ -532,10 +532,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
    1.55 @@ -577,10 +577,10 @@
    1.56        /// Its usage is quite simple, for example you can count the number
    1.57        /// of outgoing edges of a node \c n
    1.58        /// in graph \c g of type \c Graph as follows.
    1.59 -      /// \code
    1.60 +      ///\code
    1.61        /// int count=0;
    1.62        /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    1.63 -      /// \endcode
    1.64 +      ///\endcode
    1.65      
    1.66        class OutEdgeIt : public Edge {
    1.67        public:
    1.68 @@ -629,10 +629,10 @@
    1.69        /// Its usage is quite simple, for example you can count the number
    1.70        /// of outgoing edges of a node \c n
    1.71        /// in graph \c g of type \c Graph as follows.
    1.72 -      /// \code
    1.73 +      ///\code
    1.74        /// int count=0;
    1.75        /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;
    1.76 -      /// \endcode
    1.77 +      ///\endcode
    1.78  
    1.79        class InEdgeIt : public Edge {
    1.80        public: