Changeset 2421:160ebfb944a9 in lemon-0.x

Timestamp:

04/18/07 18:35:04 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3256

Message:

Small changes

Location:

lemon

Files:

• lp_utils.h (modified) (1 diff)
• topology.h (modified) (4 diffs)

lemon/lp_utils.h

@@ -887 +887 @@
         }
         os << e.constComp() << " ";
-      } 
+      }
+      if (e.begin() == e.end() && e.constComp() == 0.0) {
+        os << "0 ";
+      }
     }
 

lemon/topology.h

@@ -293 +293 @@
   ///
   /// 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 +356 @@
   /// \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 +369 @@
   /// \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 +1031 @@
 
   template <typename UGraph>
-  int countbiEdgeConnectedComponents(const UGraph& graph);
+  int countBiEdgeConnectedComponents(const UGraph& graph);
 
   /// \ingroup topology