- Spellcheck (pathes->paths)
authoralpar
Fri, 18 Nov 2005 11:17:08 +0000
changeset 1817dc3516405f8f
parent 1816 19ee9133a28c
child 1818 8f9905c4e1c1
- Spellcheck (pathes->paths)
lemon/topology.h
     1.1 --- a/lemon/topology.h	Fri Nov 18 11:13:11 2005 +0000
     1.2 +++ b/lemon/topology.h	Fri Nov 18 11:17:08 2005 +0000
     1.3 @@ -235,7 +235,7 @@
     1.4    ///
     1.5    /// Check that the given directed graph is strongly connected. The
     1.6    /// graph is strongly connected when any two nodes of the graph are
     1.7 -  /// connected with directed pathes in both direction.
     1.8 +  /// connected with directed paths in both direction.
     1.9    /// \return %False when the graph is not strongly connected.
    1.10    /// \see connected
    1.11    ///