1.1 --- a/lemon/concepts/path.h	Mon Jan 12 23:11:39 2009 +0100
     1.2 +++ b/lemon/concepts/path.h	Thu Nov 05 15:48:01 2009 +0100
     1.3 @@ -21,8 +21,8 @@
     1.4  ///\brief Classes for representing paths in digraphs.
     1.5  ///
     1.6  
     1.7 -#ifndef LEMON_CONCEPT_PATH_H
     1.8 -#define LEMON_CONCEPT_PATH_H
     1.9 +#ifndef LEMON_CONCEPTS_PATH_H
    1.10 +#define LEMON_CONCEPTS_PATH_H
    1.11  
    1.12  #include <lemon/core.h>
    1.13  #include <lemon/concept_check.h>
    1.14 @@ -38,19 +38,19 @@
    1.15      ///
    1.16      /// A skeleton structure for representing directed paths in a
    1.17      /// digraph.
    1.18 -    /// \tparam _Digraph The digraph type in which the path is.
    1.19 +    /// \tparam GR The digraph type in which the path is.
    1.20      ///
    1.21      /// In a sense, the path can be treated as a list of arcs. The
    1.22      /// lemon path type stores just this list. As a consequence it
    1.23      /// cannot enumerate the nodes in the path and the zero length
    1.24      /// paths cannot store the source.
    1.25      ///
    1.26 -    template <typename _Digraph>
    1.27 +    template <typename GR>
    1.28      class Path {
    1.29      public:
    1.30  
    1.31        /// Type of the underlying digraph.
    1.32 -      typedef _Digraph Digraph;
    1.33 +      typedef GR Digraph;
    1.34        /// Arc type of the underlying digraph.
    1.35        typedef typename Digraph::Arc Arc;
    1.36  
    1.37 @@ -205,18 +205,17 @@
    1.38      /// LEMON such algorithms gives back a path dumper what can
    1.39      /// assigned to a real path and the dumpers can be implemented as
    1.40      /// an adaptor class to the predecessor map.
    1.41 -
    1.42 -    /// \tparam _Digraph  The digraph type in which the path is.
    1.43 +    ///
    1.44 +    /// \tparam GR The digraph type in which the path is.
    1.45      ///
    1.46      /// The paths can be constructed from any path type by a
    1.47      /// template constructor or a template assignment operator.
    1.48 -    ///
    1.49 -    template <typename _Digraph>
    1.50 +    template <typename GR>
    1.51      class PathDumper {
    1.52      public:
    1.53  
    1.54        /// Type of the underlying digraph.
    1.55 -      typedef _Digraph Digraph;
    1.56 +      typedef GR Digraph;
    1.57        /// Arc type of the underlying digraph.
    1.58        typedef typename Digraph::Arc Arc;
    1.59  
    1.60 @@ -305,4 +304,4 @@
    1.61  
    1.62  } // namespace lemon
    1.63  
    1.64 -#endif // LEMON_CONCEPT_PATH_H
    1.65 +#endif