1.1 --- a/lemon/concepts/path.h Thu Mar 05 10:13:20 2009 +0000
1.2 +++ b/lemon/concepts/path.h Sun Mar 29 23:08:20 2009 +0200
1.3 @@ -38,19 +38,19 @@
1.4 ///
1.5 /// A skeleton structure for representing directed paths in a
1.6 /// digraph.
1.7 - /// \tparam _Digraph The digraph type in which the path is.
1.8 + /// \tparam GR 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 /// cannot enumerate the nodes in the path and the zero length
1.13 /// paths cannot store the source.
1.14 ///
1.15 - template <typename _Digraph>
1.16 + template <typename GR>
1.17 class Path {
1.18 public:
1.19
1.20 /// Type of the underlying digraph.
1.21 - typedef _Digraph Digraph;
1.22 + typedef GR Digraph;
1.23 /// Arc type of the underlying digraph.
1.24 typedef typename Digraph::Arc Arc;
1.25
1.26 @@ -205,18 +205,17 @@
1.27 /// LEMON such algorithms gives back a path dumper what can
1.28 /// assigned to a real path and the dumpers can be implemented as
1.29 /// an adaptor class to the predecessor map.
1.30 -
1.31 - /// \tparam _Digraph The digraph type in which the path is.
1.32 + ///
1.33 + /// \tparam GR The digraph type in which the path is.
1.34 ///
1.35 /// The paths can be constructed from any path type by a
1.36 /// template constructor or a template assignment operator.
1.37 - ///
1.38 - template <typename _Digraph>
1.39 + template <typename GR>
1.40 class PathDumper {
1.41 public:
1.42
1.43 /// Type of the underlying digraph.
1.44 - typedef _Digraph Digraph;
1.45 + typedef GR Digraph;
1.46 /// Arc type of the underlying digraph.
1.47 typedef typename Digraph::Arc Arc;
1.48