1.1 --- a/lemon/topology.h	Wed Apr 18 16:34:40 2007 +0000
     1.2 +++ b/lemon/topology.h	Wed Apr 18 16:35:04 2007 +0000
     1.3 @@ -292,9 +292,10 @@
     1.4    /// \brief Count the strongly connected components of a directed graph
     1.5    ///
     1.6    /// Count the strongly connected components of a directed graph.
     1.7 -  /// The strongly connected components are the classes of an equivalence
     1.8 -  /// relation on the nodes of the graph. Two nodes are connected with
     1.9 -  /// directed paths in both direction.
    1.10 +  /// The strongly connected components are the classes of an
    1.11 +  /// equivalence relation on the nodes of the graph. Two nodes are in
    1.12 +  /// the same class if they are connected with directed paths in both
    1.13 +  /// direction. 
    1.14    ///
    1.15    /// \param graph The graph.
    1.16    /// \return The number of components
    1.17 @@ -354,17 +355,20 @@
    1.18    ///
    1.19    /// \brief Find the strongly connected components of a directed graph
    1.20    ///
    1.21 -  /// Find the strongly connected components of a directed graph.
    1.22 -  /// The strongly connected components are the classes of an equivalence
    1.23 -  /// relation on the nodes of the graph. Two nodes are in relationship
    1.24 -  /// when there are directed paths between them in both direction.
    1.25 +  /// Find the strongly connected components of a directed graph.  The
    1.26 +  /// strongly connected components are the classes of an equivalence
    1.27 +  /// relation on the nodes of the graph. Two nodes are in
    1.28 +  /// relationship when there are directed paths between them in both
    1.29 +  /// direction. In addition, the numbering of components will satisfy
    1.30 +  /// that there is no edge going from a higher numbered component to
    1.31 +  /// a lower.
    1.32    ///
    1.33    /// \image html strongly_connected_components.png
    1.34    /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth
    1.35    ///
    1.36    /// \param graph The graph.
    1.37    /// \retval compMap A writable node map. The values will be set from 0 to
    1.38 -  /// the number of the strongly connected components minus one. Each values 
    1.39 +  /// the number of the strongly connected components minus one. Each value 
    1.40    /// of the map will be set exactly once, the values of a certain component 
    1.41    /// will be set continuously.
    1.42    /// \return The number of components
    1.43 @@ -1026,7 +1030,7 @@
    1.44    }
    1.45  
    1.46    template <typename UGraph>
    1.47 -  int countbiEdgeConnectedComponents(const UGraph& graph);
    1.48 +  int countBiEdgeConnectedComponents(const UGraph& graph);
    1.49  
    1.50    /// \ingroup topology
    1.51    ///