1.1 --- a/lemon/concepts/path.h	Sat May 17 06:30:02 2008 +0100
     1.2 +++ b/lemon/concepts/path.h	Sat May 24 23:20:49 2008 +0200
     1.3 @@ -40,7 +40,7 @@
     1.4      ///
     1.5      /// A skeleton structure for representing directed paths in a
     1.6      /// digraph.  
     1.7 -    /// \param _Digraph The digraph type in which the path is.
     1.8 +    /// \tparam _Digraph The digraph type in which the path is.
     1.9      ///
    1.10      /// In a sense, the path can be treated as a list of arcs. The
    1.11      /// lemon path type stores just this list. As a consequence it
    1.12 @@ -205,7 +205,7 @@
    1.13      /// assigned to a real path and the dumpers can be implemented as
    1.14      /// an adaptor class to the predecessor map.
    1.15  
    1.16 -    /// \param _Digraph  The digraph type in which the path is.
    1.17 +    /// \tparam _Digraph  The digraph type in which the path is.
    1.18      ///
    1.19      /// The paths can be constructed from any path type by a
    1.20      /// template constructor or a template assignment operator.