1.1 --- a/lemon/concepts/path.h Sun Jul 13 16:46:56 2008 +0100
1.2 +++ b/lemon/concepts/path.h Sun Jul 13 19:51:02 2008 +0100
1.3 @@ -1,6 +1,6 @@
1.4 -/* -*- C++ -*-
1.5 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
1.6 *
1.7 - * This file is a part of LEMON, a generic C++ optimization library
1.8 + * This file is a part of LEMON, a generic C++ optimization library.
1.9 *
1.10 * Copyright (C) 2003-2008
1.11 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.12 @@ -39,7 +39,7 @@
1.13 /// a digraph.
1.14 ///
1.15 /// A skeleton structure for representing directed paths in a
1.16 - /// digraph.
1.17 + /// digraph.
1.18 /// \tparam _Digraph The digraph type in which the path is.
1.19 ///
1.20 /// In a sense, the path can be treated as a list of arcs. The
1.21 @@ -83,25 +83,25 @@
1.22 /// This class is used to iterate on the arcs of the paths.
1.23 class ArcIt {
1.24 public:
1.25 - /// Default constructor
1.26 - ArcIt() {}
1.27 - /// Invalid constructor
1.28 - ArcIt(Invalid) {}
1.29 - /// Constructor for first arc
1.30 - ArcIt(const Path &) {}
1.31 + /// Default constructor
1.32 + ArcIt() {}
1.33 + /// Invalid constructor
1.34 + ArcIt(Invalid) {}
1.35 + /// Constructor for first arc
1.36 + ArcIt(const Path &) {}
1.37
1.38 /// Conversion to Arc
1.39 - operator Arc() const { return INVALID; }
1.40 + operator Arc() const { return INVALID; }
1.41
1.42 - /// Next arc
1.43 - ArcIt& operator++() {return *this;}
1.44 + /// Next arc
1.45 + ArcIt& operator++() {return *this;}
1.46
1.47 - /// Comparison operator
1.48 - bool operator==(const ArcIt&) const {return true;}
1.49 - /// Comparison operator
1.50 - bool operator!=(const ArcIt&) const {return true;}
1.51 - /// Comparison operator
1.52 - bool operator<(const ArcIt&) const {return false;}
1.53 + /// Comparison operator
1.54 + bool operator==(const ArcIt&) const {return true;}
1.55 + /// Comparison operator
1.56 + bool operator!=(const ArcIt&) const {return true;}
1.57 + /// Comparison operator
1.58 + bool operator<(const ArcIt&) const {return false;}
1.59
1.60 };
1.61
1.62 @@ -137,7 +137,7 @@
1.63 };
1.64
1.65 namespace _path_bits {
1.66 -
1.67 +
1.68 template <typename _Digraph, typename _Path, typename RevPathTag = void>
1.69 struct PathDumperConstraints {
1.70 void constraints() {
1.71 @@ -162,7 +162,7 @@
1.72
1.73 template <typename _Digraph, typename _Path>
1.74 struct PathDumperConstraints<
1.75 - _Digraph, _Path,
1.76 + _Digraph, _Path,
1.77 typename enable_if<typename _Path::RevPathTag, void>::type
1.78 > {
1.79 void constraints() {
1.80 @@ -184,7 +184,7 @@
1.81 }
1.82 _Path& p;
1.83 };
1.84 -
1.85 +
1.86 }
1.87
1.88
1.89 @@ -209,7 +209,7 @@
1.90 ///
1.91 /// The paths can be constructed from any path type by a
1.92 /// template constructor or a template assignment operator.
1.93 - ///
1.94 + ///
1.95 template <typename _Digraph>
1.96 class PathDumper {
1.97 public:
1.98 @@ -238,25 +238,25 @@
1.99 /// This class is used to iterate on the arcs of the paths.
1.100 class ArcIt {
1.101 public:
1.102 - /// Default constructor
1.103 - ArcIt() {}
1.104 - /// Invalid constructor
1.105 - ArcIt(Invalid) {}
1.106 - /// Constructor for first arc
1.107 - ArcIt(const PathDumper&) {}
1.108 + /// Default constructor
1.109 + ArcIt() {}
1.110 + /// Invalid constructor
1.111 + ArcIt(Invalid) {}
1.112 + /// Constructor for first arc
1.113 + ArcIt(const PathDumper&) {}
1.114
1.115 /// Conversion to Arc
1.116 - operator Arc() const { return INVALID; }
1.117 + operator Arc() const { return INVALID; }
1.118
1.119 - /// Next arc
1.120 - ArcIt& operator++() {return *this;}
1.121 + /// Next arc
1.122 + ArcIt& operator++() {return *this;}
1.123
1.124 - /// Comparison operator
1.125 - bool operator==(const ArcIt&) const {return true;}
1.126 - /// Comparison operator
1.127 - bool operator!=(const ArcIt&) const {return true;}
1.128 - /// Comparison operator
1.129 - bool operator<(const ArcIt&) const {return false;}
1.130 + /// Comparison operator
1.131 + bool operator==(const ArcIt&) const {return true;}
1.132 + /// Comparison operator
1.133 + bool operator!=(const ArcIt&) const {return true;}
1.134 + /// Comparison operator
1.135 + bool operator<(const ArcIt&) const {return false;}
1.136
1.137 };
1.138
1.139 @@ -266,25 +266,25 @@
1.140 /// reverse direction.
1.141 class RevArcIt {
1.142 public:
1.143 - /// Default constructor
1.144 - RevArcIt() {}
1.145 - /// Invalid constructor
1.146 - RevArcIt(Invalid) {}
1.147 - /// Constructor for first arc
1.148 - RevArcIt(const PathDumper &) {}
1.149 + /// Default constructor
1.150 + RevArcIt() {}
1.151 + /// Invalid constructor
1.152 + RevArcIt(Invalid) {}
1.153 + /// Constructor for first arc
1.154 + RevArcIt(const PathDumper &) {}
1.155
1.156 /// Conversion to Arc
1.157 - operator Arc() const { return INVALID; }
1.158 + operator Arc() const { return INVALID; }
1.159
1.160 - /// Next arc
1.161 - RevArcIt& operator++() {return *this;}
1.162 + /// Next arc
1.163 + RevArcIt& operator++() {return *this;}
1.164
1.165 - /// Comparison operator
1.166 - bool operator==(const RevArcIt&) const {return true;}
1.167 - /// Comparison operator
1.168 - bool operator!=(const RevArcIt&) const {return true;}
1.169 - /// Comparison operator
1.170 - bool operator<(const RevArcIt&) const {return false;}
1.171 + /// Comparison operator
1.172 + bool operator==(const RevArcIt&) const {return true;}
1.173 + /// Comparison operator
1.174 + bool operator!=(const RevArcIt&) const {return true;}
1.175 + /// Comparison operator
1.176 + bool operator<(const RevArcIt&) const {return false;}
1.177
1.178 };
1.179