1.1 --- a/lemon/connectivity.h Fri Dec 05 13:10:16 2008 +0000
1.2 +++ b/lemon/connectivity.h Mon Dec 08 11:06:39 2008 +0100
1.3 @@ -295,7 +295,7 @@
1.4 /// the same class if they are connected with directed paths in both
1.5 /// direction.
1.6 ///
1.7 - /// \param graph The graph.
1.8 + /// \param digraph The graph.
1.9 /// \return The number of components
1.10 /// \note By definition, the empty graph has zero
1.11 /// strongly connected components.
1.12 @@ -1225,7 +1225,7 @@
1.13 /// Sort the nodes of a DAG into topolgical order. It also checks
1.14 /// that the given graph is DAG.
1.15 ///
1.16 - /// \param graph The graph. It must be directed and acyclic.
1.17 + /// \param digraph The graph. It must be directed and acyclic.
1.18 /// \retval order A readable - writable node map. The values will be set
1.19 /// from 0 to the number of the nodes in the graph minus one. Each values
1.20 /// of the map will be set exactly once, the values will be set descending