1.1 --- a/src/lemon/graph_utils.h	Fri Nov 05 05:46:46 2004 +0000
     1.2 +++ b/src/lemon/graph_utils.h	Fri Nov 05 07:26:20 2004 +0000
     1.3 @@ -25,6 +25,9 @@
     1.4  ///\file
     1.5  ///\brief Graph utilities.
     1.6  ///
     1.7 +///\todo Please
     1.8 +///revise the documentation.
     1.9 +///
    1.10  
    1.11  
    1.12  namespace lemon {
    1.13 @@ -52,7 +55,7 @@
    1.14    ///
    1.15    /// This function counts the nodes in the graph.
    1.16    /// The complexity of the function is O(n) but for some
    1.17 -  /// graph structure it is specialized to O(1).
    1.18 +  /// graph structure it is specialized to run in O(1).
    1.19  
    1.20    template <typename Graph>
    1.21    inline int countNodes(const Graph& _g) {
    1.22 @@ -63,7 +66,7 @@
    1.23    ///
    1.24    /// This function counts the edges in the graph.
    1.25    /// The complexity of the function is O(e) but for some
    1.26 -  /// graph structure it is specialized to O(1).
    1.27 +  /// graph structure it is specialized to run in O(1).
    1.28    template <typename Graph>
    1.29    inline int countEdges(const Graph& _g) {
    1.30      return countItems<Graph, typename Graph::EdgeIt>(_g);
    1.31 @@ -73,7 +76,7 @@
    1.32    ///
    1.33    /// This function counts the symmetric edges in the graph.
    1.34    /// The complexity of the function is O(e) but for some
    1.35 -  /// graph structure it is specialized to O(1).
    1.36 +  /// graph structure it is specialized to run in O(1).
    1.37    template <typename Graph>
    1.38    inline int countSymEdges(const Graph& _g) {
    1.39      return countItems<Graph, typename Graph::SymEdgeIt>(_g);
    1.40 @@ -87,12 +90,20 @@
    1.41      }
    1.42      return num;
    1.43    }
    1.44 +  
    1.45 +  ///\e
    1.46  
    1.47 +  ///\todo Please document.
    1.48 +  ///
    1.49    template <typename Graph>
    1.50    inline int countOutEdges(const Graph& _g,  const typename Graph::Node& _n) {
    1.51      return countNodeDegree<Graph, typename Graph::OutEdgeIt>(_g, _n);
    1.52    }
    1.53  
    1.54 +  ///\e
    1.55 +
    1.56 +  ///\todo Please document.
    1.57 +  ///
    1.58    template <typename Graph>
    1.59    inline int countInEdges(const Graph& _g,  const typename Graph::Node& _n) {
    1.60      return countNodeDegree<Graph, typename Graph::InEdgeIt>(_g, _n);