1.1 --- a/lemon/lp_utils.h	Wed Apr 18 16:34:40 2007 +0000
     1.2 +++ b/lemon/lp_utils.h	Wed Apr 18 16:35:04 2007 +0000
     1.3 @@ -886,7 +886,10 @@
     1.4            os << "+ ";
     1.5          }
     1.6          os << e.constComp() << " ";
     1.7 -      } 
     1.8 +      }
     1.9 +      if (e.begin() == e.end() && e.constComp() == 0.0) {
    1.10 +        os << "0 ";
    1.11 +      }
    1.12      }
    1.13  
    1.14    protected:

     2.1 --- a/lemon/topology.h	Wed Apr 18 16:34:40 2007 +0000
     2.2 +++ b/lemon/topology.h	Wed Apr 18 16:35:04 2007 +0000
     2.3 @@ -292,9 +292,10 @@
     2.4    /// \brief Count the strongly connected components of a directed graph
     2.5    ///
     2.6    /// Count the strongly connected components of a directed graph.
     2.7 -  /// The strongly connected components are the classes of an equivalence
     2.8 -  /// relation on the nodes of the graph. Two nodes are connected with
     2.9 -  /// directed paths in both direction.
    2.10 +  /// The strongly connected components are the classes of an
    2.11 +  /// equivalence relation on the nodes of the graph. Two nodes are in
    2.12 +  /// the same class if they are connected with directed paths in both
    2.13 +  /// direction. 
    2.14    ///
    2.15    /// \param graph The graph.
    2.16    /// \return The number of components
    2.17 @@ -354,17 +355,20 @@
    2.18    ///
    2.19    /// \brief Find the strongly connected components of a directed graph
    2.20    ///
    2.21 -  /// Find the strongly connected components of a directed graph.
    2.22 -  /// The strongly connected components are the classes of an equivalence
    2.23 -  /// relation on the nodes of the graph. Two nodes are in relationship
    2.24 -  /// when there are directed paths between them in both direction.
    2.25 +  /// Find the strongly connected components of a directed graph.  The
    2.26 +  /// strongly connected components are the classes of an equivalence
    2.27 +  /// relation on the nodes of the graph. Two nodes are in
    2.28 +  /// relationship when there are directed paths between them in both
    2.29 +  /// direction. In addition, the numbering of components will satisfy
    2.30 +  /// that there is no edge going from a higher numbered component to
    2.31 +  /// a lower.
    2.32    ///
    2.33    /// \image html strongly_connected_components.png
    2.34    /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth
    2.35    ///
    2.36    /// \param graph The graph.
    2.37    /// \retval compMap A writable node map. The values will be set from 0 to
    2.38 -  /// the number of the strongly connected components minus one. Each values 
    2.39 +  /// the number of the strongly connected components minus one. Each value 
    2.40    /// of the map will be set exactly once, the values of a certain component 
    2.41    /// will be set continuously.
    2.42    /// \return The number of components
    2.43 @@ -1026,7 +1030,7 @@
    2.44    }
    2.45  
    2.46    template <typename UGraph>
    2.47 -  int countbiEdgeConnectedComponents(const UGraph& graph);
    2.48 +  int countBiEdgeConnectedComponents(const UGraph& graph);
    2.49  
    2.50    /// \ingroup topology
    2.51    ///