1.1 --- a/lemon/bits/graph_extender.h	Thu Oct 09 10:09:44 2008 +0200
     1.2 +++ b/lemon/bits/graph_extender.h	Thu Oct 09 13:27:35 2008 +0200
     1.3 @@ -27,14 +27,14 @@
     1.4  #include <lemon/concept_check.h>
     1.5  #include <lemon/concepts/maps.h>
     1.6  
     1.7 -///\ingroup graphbits
     1.8 -///\file
     1.9 -///\brief Extenders for the digraph types
    1.10 +//\ingroup graphbits
    1.11 +//\file
    1.12 +//\brief Extenders for the digraph types
    1.13  namespace lemon {
    1.14  
    1.15 -  /// \ingroup graphbits
    1.16 -  ///
    1.17 -  /// \brief Extender for the Digraphs
    1.18 +  // \ingroup graphbits
    1.19 +  //
    1.20 +  // \brief Extender for the Digraphs
    1.21    template <typename Base>
    1.22    class DigraphExtender : public Base {
    1.23    public:
    1.24 @@ -186,30 +186,30 @@
    1.25  
    1.26      };
    1.27  
    1.28 -    /// \brief Base node of the iterator
    1.29 -    ///
    1.30 -    /// Returns the base node (i.e. the source in this case) of the iterator
    1.31 +    // \brief Base node of the iterator
    1.32 +    //
    1.33 +    // Returns the base node (i.e. the source in this case) of the iterator
    1.34      Node baseNode(const OutArcIt &arc) const {
    1.35        return Parent::source(arc);
    1.36      }
    1.37 -    /// \brief Running node of the iterator
    1.38 -    ///
    1.39 -    /// Returns the running node (i.e. the target in this case) of the
    1.40 -    /// iterator
    1.41 +    // \brief Running node of the iterator
    1.42 +    //
    1.43 +    // Returns the running node (i.e. the target in this case) of the
    1.44 +    // iterator
    1.45      Node runningNode(const OutArcIt &arc) const {
    1.46        return Parent::target(arc);
    1.47      }
    1.48  
    1.49 -    /// \brief Base node of the iterator
    1.50 -    ///
    1.51 -    /// Returns the base node (i.e. the target in this case) of the iterator
    1.52 +    // \brief Base node of the iterator
    1.53 +    //
    1.54 +    // Returns the base node (i.e. the target in this case) of the iterator
    1.55      Node baseNode(const InArcIt &arc) const {
    1.56        return Parent::target(arc);
    1.57      }
    1.58 -    /// \brief Running node of the iterator
    1.59 -    ///
    1.60 -    /// Returns the running node (i.e. the source in this case) of the
    1.61 -    /// iterator
    1.62 +    // \brief Running node of the iterator
    1.63 +    //
    1.64 +    // Returns the running node (i.e. the source in this case) of the
    1.65 +    // iterator
    1.66      Node runningNode(const InArcIt &arc) const {
    1.67        return Parent::source(arc);
    1.68      }
    1.69 @@ -325,9 +325,9 @@
    1.70      }
    1.71    };
    1.72  
    1.73 -  /// \ingroup _graphbits
    1.74 -  ///
    1.75 -  /// \brief Extender for the Graphs
    1.76 +  // \ingroup _graphbits
    1.77 +  //
    1.78 +  // \brief Extender for the Graphs
    1.79    template <typename Base>
    1.80    class GraphExtender : public Base {
    1.81    public:
    1.82 @@ -555,43 +555,43 @@
    1.83        }
    1.84      };
    1.85  
    1.86 -    /// \brief Base node of the iterator
    1.87 -    ///
    1.88 -    /// Returns the base node (ie. the source in this case) of the iterator
    1.89 +    // \brief Base node of the iterator
    1.90 +    //
    1.91 +    // Returns the base node (ie. the source in this case) of the iterator
    1.92      Node baseNode(const OutArcIt &arc) const {
    1.93        return Parent::source(static_cast<const Arc&>(arc));
    1.94      }
    1.95 -    /// \brief Running node of the iterator
    1.96 -    ///
    1.97 -    /// Returns the running node (ie. the target in this case) of the
    1.98 -    /// iterator
    1.99 +    // \brief Running node of the iterator
   1.100 +    //
   1.101 +    // Returns the running node (ie. the target in this case) of the
   1.102 +    // iterator
   1.103      Node runningNode(const OutArcIt &arc) const {
   1.104        return Parent::target(static_cast<const Arc&>(arc));
   1.105      }
   1.106  
   1.107 -    /// \brief Base node of the iterator
   1.108 -    ///
   1.109 -    /// Returns the base node (ie. the target in this case) of the iterator
   1.110 +    // \brief Base node of the iterator
   1.111 +    //
   1.112 +    // Returns the base node (ie. the target in this case) of the iterator
   1.113      Node baseNode(const InArcIt &arc) const {
   1.114        return Parent::target(static_cast<const Arc&>(arc));
   1.115      }
   1.116 -    /// \brief Running node of the iterator
   1.117 -    ///
   1.118 -    /// Returns the running node (ie. the source in this case) of the
   1.119 -    /// iterator
   1.120 +    // \brief Running node of the iterator
   1.121 +    //
   1.122 +    // Returns the running node (ie. the source in this case) of the
   1.123 +    // iterator
   1.124      Node runningNode(const InArcIt &arc) const {
   1.125        return Parent::source(static_cast<const Arc&>(arc));
   1.126      }
   1.127  
   1.128 -    /// Base node of the iterator
   1.129 -    ///
   1.130 -    /// Returns the base node of the iterator
   1.131 +    // Base node of the iterator
   1.132 +    //
   1.133 +    // Returns the base node of the iterator
   1.134      Node baseNode(const IncEdgeIt &edge) const {
   1.135        return edge._direction ? u(edge) : v(edge);
   1.136      }
   1.137 -    /// Running node of the iterator
   1.138 -    ///
   1.139 -    /// Returns the running node of the iterator
   1.140 +    // Running node of the iterator
   1.141 +    //
   1.142 +    // Returns the running node of the iterator
   1.143      Node runningNode(const IncEdgeIt &edge) const {
   1.144        return edge._direction ? v(edge) : u(edge);
   1.145      }