1.1 --- a/lemon/concepts/path.h	Fri Nov 13 12:33:33 2009 +0100
     1.2 +++ b/lemon/concepts/path.h	Thu Dec 10 17:05:35 2009 +0100
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2008
     1.8 + * Copyright (C) 2003-2009
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -21,8 +21,8 @@
    1.13  ///\brief Classes for representing paths in digraphs.
    1.14  ///
    1.15  
    1.16 -#ifndef LEMON_CONCEPT_PATH_H
    1.17 -#define LEMON_CONCEPT_PATH_H
    1.18 +#ifndef LEMON_CONCEPTS_PATH_H
    1.19 +#define LEMON_CONCEPTS_PATH_H
    1.20  
    1.21  #include <lemon/core.h>
    1.22  #include <lemon/concept_check.h>
    1.23 @@ -38,19 +38,19 @@
    1.24      ///
    1.25      /// A skeleton structure for representing directed paths in a
    1.26      /// digraph.
    1.27 -    /// \tparam _Digraph The digraph type in which the path is.
    1.28 +    /// \tparam GR The digraph type in which the path is.
    1.29      ///
    1.30      /// In a sense, the path can be treated as a list of arcs. The
    1.31      /// lemon path type stores just this list. As a consequence it
    1.32      /// cannot enumerate the nodes in the path and the zero length
    1.33      /// paths cannot store the source.
    1.34      ///
    1.35 -    template <typename _Digraph>
    1.36 +    template <typename GR>
    1.37      class Path {
    1.38      public:
    1.39  
    1.40        /// Type of the underlying digraph.
    1.41 -      typedef _Digraph Digraph;
    1.42 +      typedef GR Digraph;
    1.43        /// Arc type of the underlying digraph.
    1.44        typedef typename Digraph::Arc Arc;
    1.45  
    1.46 @@ -205,18 +205,17 @@
    1.47      /// LEMON such algorithms gives back a path dumper what can
    1.48      /// assigned to a real path and the dumpers can be implemented as
    1.49      /// an adaptor class to the predecessor map.
    1.50 -
    1.51 -    /// \tparam _Digraph  The digraph type in which the path is.
    1.52 +    ///
    1.53 +    /// \tparam GR The digraph type in which the path is.
    1.54      ///
    1.55      /// The paths can be constructed from any path type by a
    1.56      /// template constructor or a template assignment operator.
    1.57 -    ///
    1.58 -    template <typename _Digraph>
    1.59 +    template <typename GR>
    1.60      class PathDumper {
    1.61      public:
    1.62  
    1.63        /// Type of the underlying digraph.
    1.64 -      typedef _Digraph Digraph;
    1.65 +      typedef GR Digraph;
    1.66        /// Arc type of the underlying digraph.
    1.67        typedef typename Digraph::Arc Arc;
    1.68  
    1.69 @@ -305,4 +304,4 @@
    1.70  
    1.71  } // namespace lemon
    1.72  
    1.73 -#endif // LEMON_CONCEPT_PATH_H
    1.74 +#endif