1.1 --- a/lemon/graph_utils.h Sun Sep 16 14:21:12 2007 +0000
1.2 +++ b/lemon/graph_utils.h Wed Sep 19 23:35:27 2007 +0000
1.3 @@ -36,9 +36,6 @@
1.4 ///\ingroup gutils
1.5 ///\file
1.6 ///\brief Graph utilities.
1.7 -///
1.8 -///
1.9 -
1.10
1.11 namespace lemon {
1.12
1.13 @@ -149,7 +146,7 @@
1.14 /// The complexity of the function is O(n) but for some
1.15 /// graph structures it is specialized to run in O(1).
1.16 ///
1.17 - /// \todo refer how to specialize it
1.18 + /// \todo Refer how to specialize it.
1.19
1.20 template <typename Graph>
1.21 inline int countNodes(const Graph& g) {
1.22 @@ -182,7 +179,7 @@
1.23 /// The complexity of the function is O(an) but for some
1.24 /// graph structures it is specialized to run in O(1).
1.25 ///
1.26 - /// \todo refer how to specialize it
1.27 + /// \todo Refer how to specialize it.
1.28
1.29 template <typename Graph>
1.30 inline int countANodes(const Graph& g) {
1.31 @@ -215,7 +212,7 @@
1.32 /// The complexity of the function is O(bn) but for some
1.33 /// graph structures it is specialized to run in O(1).
1.34 ///
1.35 - /// \todo refer how to specialize it
1.36 + /// \todo Refer how to specialize it.
1.37
1.38 template <typename Graph>
1.39 inline int countBNodes(const Graph& g) {
1.40 @@ -375,7 +372,7 @@
1.41 ///\endcode
1.42 ///
1.43 ///\sa EdgeLookUp
1.44 - ///\se AllEdgeLookup
1.45 + ///\se AllEdgeLookUp
1.46 ///\sa ConEdgeIt
1.47 template <typename Graph>
1.48 inline typename Graph::Edge
1.49 @@ -397,7 +394,7 @@
1.50 ///
1.51 ///\sa findEdge()
1.52 ///\sa EdgeLookUp
1.53 - ///\sa AllEdgeLookup
1.54 + ///\sa AllEdgeLookUp
1.55 ///
1.56 /// \author Balazs Dezso
1.57 template <typename _Graph>
1.58 @@ -2041,6 +2038,7 @@
1.59 /// \brief Returns the source of the given edge.
1.60 ///
1.61 /// The SourceMap gives back the source Node of the given edge.
1.62 + /// \see TargetMap
1.63 /// \author Balazs Dezso
1.64 template <typename Graph>
1.65 class SourceMap {
1.66 @@ -2068,7 +2066,7 @@
1.67 const Graph& graph;
1.68 };
1.69
1.70 - /// \brief Returns a \ref SourceMap class
1.71 + /// \brief Returns a \ref SourceMap class.
1.72 ///
1.73 /// This function just returns an \ref SourceMap class.
1.74 /// \relates SourceMap
1.75 @@ -2080,6 +2078,7 @@
1.76 /// \brief Returns the target of the given edge.
1.77 ///
1.78 /// The TargetMap gives back the target Node of the given edge.
1.79 + /// \see SourceMap
1.80 /// \author Balazs Dezso
1.81 template <typename Graph>
1.82 class TargetMap {
1.83 @@ -2107,7 +2106,7 @@
1.84 const Graph& graph;
1.85 };
1.86
1.87 - /// \brief Returns a \ref TargetMap class
1.88 + /// \brief Returns a \ref TargetMap class.
1.89 ///
1.90 /// This function just returns a \ref TargetMap class.
1.91 /// \relates TargetMap
1.92 @@ -2119,6 +2118,7 @@
1.93 /// \brief Returns the "forward" directed edge view of an undirected edge.
1.94 ///
1.95 /// Returns the "forward" directed edge view of an undirected edge.
1.96 + /// \see BackwardMap
1.97 /// \author Balazs Dezso
1.98 template <typename Graph>
1.99 class ForwardMap {
1.100 @@ -2146,7 +2146,7 @@
1.101 const Graph& graph;
1.102 };
1.103
1.104 - /// \brief Returns a \ref ForwardMap class
1.105 + /// \brief Returns a \ref ForwardMap class.
1.106 ///
1.107 /// This function just returns an \ref ForwardMap class.
1.108 /// \relates ForwardMap
1.109 @@ -2158,6 +2158,7 @@
1.110 /// \brief Returns the "backward" directed edge view of an undirected edge.
1.111 ///
1.112 /// Returns the "backward" directed edge view of an undirected edge.
1.113 + /// \see ForwardMap
1.114 /// \author Balazs Dezso
1.115 template <typename Graph>
1.116 class BackwardMap {
1.117 @@ -2224,9 +2225,9 @@
1.118 const NodeMap& potential;
1.119 };
1.120
1.121 - /// \brief Just returns a PotentialDifferenceMap
1.122 + /// \brief Returns a PotentialDifferenceMap.
1.123 ///
1.124 - /// Just returns a PotentialDifferenceMap
1.125 + /// This function just returns a PotentialDifferenceMap.
1.126 /// \relates PotentialDifferenceMap
1.127 template <typename Graph, typename NodeMap>
1.128 PotentialDifferenceMap<Graph, NodeMap>