1.1 --- a/lemon/graph_utils.h Sat May 17 06:30:02 2008 +0100
1.2 +++ b/lemon/graph_utils.h Sat May 24 23:20:49 2008 +0200
1.3 @@ -354,8 +354,6 @@
1.4 ///\sa ArcLookUp
1.5 ///\sa AllArcLookUp
1.6 ///\sa DynArcLookUp
1.7 - ///
1.8 - /// \author Balazs Dezso
1.9 template <typename _Graph>
1.10 class ConArcIt : public _Graph::Arc {
1.11 public:
1.12 @@ -478,8 +476,6 @@
1.13 ///\endcode
1.14 ///
1.15 ///\sa findEdge()
1.16 - ///
1.17 - /// \author Balazs Dezso
1.18 template <typename _Graph>
1.19 class ConEdgeIt : public _Graph::Edge {
1.20 public:
1.21 @@ -1242,9 +1238,9 @@
1.22 /// The values of the map can be accessed
1.23 /// with stl compatible forward iterator.
1.24 ///
1.25 - /// \param _Graph The graph type.
1.26 - /// \param _Item The item type of the graph.
1.27 - /// \param _Value The value type of the map.
1.28 + /// \tparam _Graph The graph type.
1.29 + /// \tparam _Item The item type of the graph.
1.30 + /// \tparam _Value The value type of the map.
1.31 ///
1.32 /// \see IterableValueMap
1.33 template <typename _Graph, typename _Item, typename _Value>
1.34 @@ -1447,8 +1443,8 @@
1.35 /// other node, i.e. this id is mutable). </ul> This map can be inverted
1.36 /// with its member class \c InverseMap, or with the \c operator() member.
1.37 ///
1.38 - /// \param _Graph The graph class the \c DescriptorMap belongs to.
1.39 - /// \param _Item The Item is the Key of the Map. It may be Node, Arc or
1.40 + /// \tparam _Graph The graph class the \c DescriptorMap belongs to.
1.41 + /// \tparam _Item The Item is the Key of the Map. It may be Node, Arc or
1.42 /// Edge.
1.43 template <typename _Graph, typename _Item>
1.44 class DescriptorMap : protected DefaultMap<_Graph, _Item, int> {
1.45 @@ -1637,7 +1633,6 @@
1.46 ///
1.47 /// The SourceMap gives back the source Node of the given arc.
1.48 /// \see TargetMap
1.49 - /// \author Balazs Dezso
1.50 template <typename Digraph>
1.51 class SourceMap {
1.52 public:
1.53 @@ -1677,7 +1672,6 @@
1.54 ///
1.55 /// The TargetMap gives back the target Node of the given arc.
1.56 /// \see SourceMap
1.57 - /// \author Balazs Dezso
1.58 template <typename Digraph>
1.59 class TargetMap {
1.60 public:
1.61 @@ -1717,7 +1711,6 @@
1.62 ///
1.63 /// Returns the "forward" directed arc view of an edge.
1.64 /// \see BackwardMap
1.65 - /// \author Balazs Dezso
1.66 template <typename Graph>
1.67 class ForwardMap {
1.68 public:
1.69 @@ -1757,7 +1750,6 @@
1.70 ///
1.71 /// Returns the "backward" directed arc view of an edge.
1.72 /// \see ForwardMap
1.73 - /// \author Balazs Dezso
1.74 template <typename Graph>
1.75 class BackwardMap {
1.76 public:
1.77 @@ -2096,7 +2088,7 @@
1.78 ///optimal time bound in a constant factor for any distribution of
1.79 ///queries.
1.80 ///
1.81 - ///\param G The type of the underlying digraph.
1.82 + ///\tparam G The type of the underlying digraph.
1.83 ///
1.84 ///\sa ArcLookUp
1.85 ///\sa AllArcLookUp
1.86 @@ -2537,7 +2529,7 @@
1.87 ///whenever the digraph changes. This is a time consuming (superlinearly
1.88 ///proportional (<em>O(m</em>log<em>m)</em>) to the number of arcs).
1.89 ///
1.90 - ///\param G The type of the underlying digraph.
1.91 + ///\tparam G The type of the underlying digraph.
1.92 ///
1.93 ///\sa DynArcLookUp
1.94 ///\sa AllArcLookUp
1.95 @@ -2650,7 +2642,7 @@
1.96 ///whenever the digraph changes. This is a time consuming (superlinearly
1.97 ///proportional (<em>O(m</em>log<em>m)</em>) to the number of arcs).
1.98 ///
1.99 - ///\param G The type of the underlying digraph.
1.100 + ///\tparam G The type of the underlying digraph.
1.101 ///
1.102 ///\sa DynArcLookUp
1.103 ///\sa ArcLookUp