lemon-0.x: comparison lemon/topology.h

equal deleted inserted replaced

-:2f9cb4a105ed
+:3075a677478b
 /// \ingroup topology
 ///
 /// \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
+/// The strongly connected components are the classes of an
-/// relation on the nodes of the graph. Two nodes are connected with
+/// equivalence relation on the nodes of the graph. Two nodes are in
-/// directed paths in both direction.
+/// the same class if they are connected with directed paths in both
+/// direction.
 ///
 /// \param graph The graph.
 /// \return The number of components
 /// \note By definition, the empty graph has zero
 /// strongly connected components.
 /// \ingroup topology
 ///
 /// \brief Find the strongly connected components of a directed graph
 ///
-/// Find the strongly connected components of a directed graph.
+/// Find the strongly connected components of a directed graph.  The
-/// The strongly connected components are the classes of an equivalence
+/// strongly connected components are the classes of an equivalence
-/// relation on the nodes of the graph. Two nodes are in relationship
+/// relation on the nodes of the graph. Two nodes are in
-/// when there are directed paths between them in both direction.
+/// 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
 ///
 template <typename Graph, typename NodeMap>
 int _num;
 };
 }
 template <typename UGraph>
-int countbiEdgeConnectedComponents(const UGraph& graph);
+int countBiEdgeConnectedComponents(const UGraph& graph);
 /// \ingroup topology
 ///
 /// \brief Checks that the graph is bi-edge-connected.
 ///

changeset 2428	c06e86364234
parent 2391	14a343be7a5a
child 2429	fd51b552bcf2