Index: lemon/lp_utils.h
===================================================================
--- lemon/lp_utils.h (revision 2391)
+++ lemon/lp_utils.h (revision 2421)
@@ -887,5 +887,8 @@
}
os << e.constComp() << " ";
- }
+ }
+ if (e.begin() == e.end() && e.constComp() == 0.0) {
+ os << "0 ";
+ }
}
Index: lemon/topology.h
===================================================================
--- lemon/topology.h (revision 2391)
+++ lemon/topology.h (revision 2421)
@@ -293,7 +293,8 @@
///
/// 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.
@@ -355,8 +356,11 @@
/// \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
@@ -365,5 +369,5 @@
/// \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.
@@ -1027,5 +1031,5 @@
template
- int countbiEdgeConnectedComponents(const UGraph& graph);
+ int countBiEdgeConnectedComponents(const UGraph& graph);
/// \ingroup topology