1.1 --- a/lemon/graph_utils.h	Thu Feb 02 17:09:09 2006 +0000
     1.2 +++ b/lemon/graph_utils.h	Thu Feb 02 17:43:24 2006 +0000
     1.3 @@ -258,11 +258,11 @@
     1.4    /// \return The found edge or \ref INVALID if there is no such an edge.
     1.5    ///
     1.6    /// Thus you can iterate through each edge from \c u to \c v as it follows.
     1.7 -  /// \code
     1.8 +  ///\code
     1.9    /// for(Edge e=findEdge(g,u,v);e!=INVALID;e=findEdge(g,u,v,e)) {
    1.10    ///   ...
    1.11    /// }
    1.12 -  /// \endcode
    1.13 +  ///\endcode
    1.14    // /// \todo We may want to use the "GraphBase" 
    1.15    // /// interface here...
    1.16    template <typename Graph>
    1.17 @@ -278,11 +278,11 @@
    1.18    /// Iterator for iterating on edges connected the same nodes. It is 
    1.19    /// higher level interface for the findEdge() function. You can
    1.20    /// use it the following way:
    1.21 -  /// \code
    1.22 +  ///\code
    1.23    /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
    1.24    ///   ...
    1.25    /// }
    1.26 -  /// \endcode
    1.27 +  ///\endcode
    1.28    ///
    1.29    /// \author Balazs Dezso 
    1.30    template <typename _Graph>
    1.31 @@ -360,12 +360,12 @@
    1.32    /// \return The found edge or \ref INVALID if there is no such an edge.
    1.33    ///
    1.34    /// Thus you can iterate through each edge from \c u to \c v as it follows.
    1.35 -  /// \code
    1.36 +  ///\code
    1.37    /// for(UEdge e = findUEdge(g,u,v); e != INVALID; 
    1.38    ///     e = findUEdge(g,u,v,e)) {
    1.39    ///   ...
    1.40    /// }
    1.41 -  /// \endcode
    1.42 +  ///\endcode
    1.43    // /// \todo We may want to use the "GraphBase" 
    1.44    // /// interface here...
    1.45    template <typename Graph>
    1.46 @@ -382,11 +382,11 @@
    1.47    /// Iterator for iterating on uedges connected the same nodes. It is 
    1.48    /// higher level interface for the findUEdge() function. You can
    1.49    /// use it the following way:
    1.50 -  /// \code
    1.51 +  ///\code
    1.52    /// for (ConUEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
    1.53    ///   ...
    1.54    /// }
    1.55 -  /// \endcode
    1.56 +  ///\endcode
    1.57    ///
    1.58    /// \author Balazs Dezso 
    1.59    template <typename _Graph>
    1.60 @@ -580,9 +580,9 @@
    1.61    /// Copy a graph to an other graph.
    1.62    /// The usage of the function:
    1.63    /// 
    1.64 -  /// \code
    1.65 +  ///\code
    1.66    /// copyGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr);
    1.67 -  /// \endcode
    1.68 +  ///\endcode
    1.69    /// 
    1.70    /// After the copy the \c nr map will contain the mapping from the
    1.71    /// source graph's nodes to the target graph's nodes and the \c ecr will
    1.72 @@ -792,9 +792,9 @@
    1.73    /// Copy a graph to an other graph.
    1.74    /// The usage of the function:
    1.75    /// 
    1.76 -  /// \code
    1.77 +  ///\code
    1.78    /// copyGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr);
    1.79 -  /// \endcode
    1.80 +  ///\endcode
    1.81    /// 
    1.82    /// After the copy the \c nr map will contain the mapping from the
    1.83    /// source graph's nodes to the target graph's nodes and the \c ecr will