# HG changeset patch
# User deba
# Date 1176914104 0
# Node ID 160ebfb944a904de49bb1f6ef1d34b0aa7b2d441
# Parent  07c4f9bcb4d59d8256e190620dc90965be4c2da7
Small changes

diff -r 07c4f9bcb4d5 -r 160ebfb944a9 lemon/lp_utils.h
--- a/lemon/lp_utils.h	Wed Apr 18 16:34:40 2007 +0000
+++ b/lemon/lp_utils.h	Wed Apr 18 16:35:04 2007 +0000
@@ -886,7 +886,10 @@
           os << "+ ";
         }
         os << e.constComp() << " ";
-      } 
+      }
+      if (e.begin() == e.end() && e.constComp() == 0.0) {
+        os << "0 ";
+      }
     }
 
   protected:
diff -r 07c4f9bcb4d5 -r 160ebfb944a9 lemon/topology.h
--- a/lemon/topology.h	Wed Apr 18 16:34:40 2007 +0000
+++ b/lemon/topology.h	Wed Apr 18 16:35:04 2007 +0000
@@ -292,9 +292,10 @@
   /// \brief Count the strongly connected components of a directed graph
   ///
   /// Count the strongly connected components of a directed graph.
-  /// The strongly connected components are the classes of an equivalence
-  /// relation on the nodes of the graph. Two nodes are connected with
-  /// directed paths in both direction.
+  /// The strongly connected components are the classes of an
+  /// equivalence relation on the nodes of the graph. Two nodes are in
+  /// the same class if they are connected with directed paths in both
+  /// direction. 
   ///
   /// \param graph The graph.
   /// \return The number of components
@@ -354,17 +355,20 @@
   ///
   /// \brief Find the strongly connected components of a directed graph
   ///
-  /// Find the strongly connected components of a directed graph.
-  /// The strongly connected components are the classes of an equivalence
-  /// relation on the nodes of the graph. Two nodes are in relationship
-  /// when there are directed paths between them in both direction.
+  /// Find the strongly connected components of a directed graph.  The
+  /// strongly connected components are the classes of an equivalence
+  /// relation on the nodes of the graph. Two nodes are in
+  /// relationship when there are directed paths between them in both
+  /// direction. In addition, the numbering of components will satisfy
+  /// that there is no edge going from a higher numbered component to
+  /// a lower.
   ///
   /// \image html strongly_connected_components.png
   /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth
   ///
   /// \param graph The graph.
   /// \retval compMap A writable node map. The values will be set from 0 to
-  /// the number of the strongly connected components minus one. Each values 
+  /// the number of the strongly connected components minus one. Each value 
   /// of the map will be set exactly once, the values of a certain component 
   /// will be set continuously.
   /// \return The number of components
@@ -1026,7 +1030,7 @@
   }
 
   template <typename UGraph>
-  int countbiEdgeConnectedComponents(const UGraph& graph);
+  int countBiEdgeConnectedComponents(const UGraph& graph);
 
   /// \ingroup topology
   ///