1.1 --- a/lemon/bits/edge_set_extender.h Thu Mar 05 10:13:20 2009 +0000
1.2 +++ b/lemon/bits/edge_set_extender.h Sun Mar 29 23:08:20 2009 +0200
1.3 @@ -24,14 +24,14 @@
1.4 #include <lemon/bits/default_map.h>
1.5 #include <lemon/bits/map_extender.h>
1.6
1.7 -///\ingroup digraphbits
1.8 -///\file
1.9 -///\brief Extenders for the arc set types
1.10 +//\ingroup digraphbits
1.11 +//\file
1.12 +//\brief Extenders for the arc set types
1.13 namespace lemon {
1.14
1.15 - /// \ingroup digraphbits
1.16 - ///
1.17 - /// \brief Extender for the ArcSets
1.18 + // \ingroup digraphbits
1.19 + //
1.20 + // \brief Extender for the ArcSets
1.21 template <typename Base>
1.22 class ArcSetExtender : public Base {
1.23 public:
1.24 @@ -72,7 +72,7 @@
1.25
1.26 // Alteration notifier extensions
1.27
1.28 - /// The arc observer registry.
1.29 + // The arc observer registry.
1.30 typedef AlterationNotifier<ArcSetExtender, Arc> ArcNotifier;
1.31
1.32 protected:
1.33 @@ -83,9 +83,7 @@
1.34
1.35 using Parent::notifier;
1.36
1.37 - /// \brief Gives back the arc alteration notifier.
1.38 - ///
1.39 - /// Gives back the arc alteration notifier.
1.40 + // Gives back the arc alteration notifier.
1.41 ArcNotifier& notifier(Arc) const {
1.42 return arc_notifier;
1.43 }
1.44 @@ -185,30 +183,30 @@
1.45
1.46 };
1.47
1.48 - /// \brief Base node of the iterator
1.49 - ///
1.50 - /// Returns the base node (ie. the source in this case) of the iterator
1.51 + // \brief Base node of the iterator
1.52 + //
1.53 + // Returns the base node (ie. the source in this case) of the iterator
1.54 Node baseNode(const OutArcIt &e) const {
1.55 return Parent::source(static_cast<const Arc&>(e));
1.56 }
1.57 - /// \brief Running node of the iterator
1.58 - ///
1.59 - /// Returns the running node (ie. the target in this case) of the
1.60 - /// iterator
1.61 + // \brief Running node of the iterator
1.62 + //
1.63 + // Returns the running node (ie. the target in this case) of the
1.64 + // iterator
1.65 Node runningNode(const OutArcIt &e) const {
1.66 return Parent::target(static_cast<const Arc&>(e));
1.67 }
1.68
1.69 - /// \brief Base node of the iterator
1.70 - ///
1.71 - /// Returns the base node (ie. the target in this case) of the iterator
1.72 + // \brief Base node of the iterator
1.73 + //
1.74 + // Returns the base node (ie. the target in this case) of the iterator
1.75 Node baseNode(const InArcIt &e) const {
1.76 return Parent::target(static_cast<const Arc&>(e));
1.77 }
1.78 - /// \brief Running node of the iterator
1.79 - ///
1.80 - /// Returns the running node (ie. the source in this case) of the
1.81 - /// iterator
1.82 + // \brief Running node of the iterator
1.83 + //
1.84 + // Returns the running node (ie. the source in this case) of the
1.85 + // iterator
1.86 Node runningNode(const InArcIt &e) const {
1.87 return Parent::source(static_cast<const Arc&>(e));
1.88 }
1.89 @@ -271,9 +269,9 @@
1.90 };
1.91
1.92
1.93 - /// \ingroup digraphbits
1.94 - ///
1.95 - /// \brief Extender for the EdgeSets
1.96 + // \ingroup digraphbits
1.97 + //
1.98 + // \brief Extender for the EdgeSets
1.99 template <typename Base>
1.100 class EdgeSetExtender : public Base {
1.101
1.102 @@ -492,43 +490,43 @@
1.103 }
1.104 };
1.105
1.106 - /// \brief Base node of the iterator
1.107 - ///
1.108 - /// Returns the base node (ie. the source in this case) of the iterator
1.109 + // \brief Base node of the iterator
1.110 + //
1.111 + // Returns the base node (ie. the source in this case) of the iterator
1.112 Node baseNode(const OutArcIt &e) const {
1.113 return Parent::source(static_cast<const Arc&>(e));
1.114 }
1.115 - /// \brief Running node of the iterator
1.116 - ///
1.117 - /// Returns the running node (ie. the target in this case) of the
1.118 - /// iterator
1.119 + // \brief Running node of the iterator
1.120 + //
1.121 + // Returns the running node (ie. the target in this case) of the
1.122 + // iterator
1.123 Node runningNode(const OutArcIt &e) const {
1.124 return Parent::target(static_cast<const Arc&>(e));
1.125 }
1.126
1.127 - /// \brief Base node of the iterator
1.128 - ///
1.129 - /// Returns the base node (ie. the target in this case) of the iterator
1.130 + // \brief Base node of the iterator
1.131 + //
1.132 + // Returns the base node (ie. the target in this case) of the iterator
1.133 Node baseNode(const InArcIt &e) const {
1.134 return Parent::target(static_cast<const Arc&>(e));
1.135 }
1.136 - /// \brief Running node of the iterator
1.137 - ///
1.138 - /// Returns the running node (ie. the source in this case) of the
1.139 - /// iterator
1.140 + // \brief Running node of the iterator
1.141 + //
1.142 + // Returns the running node (ie. the source in this case) of the
1.143 + // iterator
1.144 Node runningNode(const InArcIt &e) const {
1.145 return Parent::source(static_cast<const Arc&>(e));
1.146 }
1.147
1.148 - /// Base node of the iterator
1.149 - ///
1.150 - /// Returns the base node of the iterator
1.151 + // Base node of the iterator
1.152 + //
1.153 + // Returns the base node of the iterator
1.154 Node baseNode(const IncEdgeIt &e) const {
1.155 return e.direction ? u(e) : v(e);
1.156 }
1.157 - /// Running node of the iterator
1.158 - ///
1.159 - /// Returns the running node of the iterator
1.160 + // Running node of the iterator
1.161 + //
1.162 + // Returns the running node of the iterator
1.163 Node runningNode(const IncEdgeIt &e) const {
1.164 return e.direction ? v(e) : u(e);
1.165 }