1.1 --- a/lemon/circulation.h Tue Dec 02 15:33:22 2008 +0000
1.2 +++ b/lemon/circulation.h Fri Dec 05 00:22:47 2008 +0100
1.3 @@ -419,7 +419,7 @@
1.4 ///
1.5 /// \pre Either \ref run() or \ref init() must be called before
1.6 /// using this function.
1.7 - const Elevator& elevator() {
1.8 + const Elevator& elevator() const {
1.9 return *_level;
1.10 }
1.11
1.12 @@ -644,7 +644,7 @@
1.13 ///
1.14 /// \pre Either \ref run() or \ref init() must be called before
1.15 /// using this function.
1.16 - const FlowMap& flowMap() {
1.17 + const FlowMap& flowMap() const {
1.18 return *_flow;
1.19 }
1.20
1.21 @@ -669,7 +669,7 @@
1.22 \sa barrierMap()
1.23 \sa checkBarrier()
1.24 */
1.25 - bool barrier(const Node& node)
1.26 + bool barrier(const Node& node) const
1.27 {
1.28 return (*_level)[node] >= _el;
1.29 }
1.30 @@ -692,7 +692,7 @@
1.31 /// \sa barrier()
1.32 /// \sa checkBarrier()
1.33 template<class BarrierMap>
1.34 - void barrierMap(BarrierMap &bar)
1.35 + void barrierMap(BarrierMap &bar) const
1.36 {
1.37 for(NodeIt n(_g);n!=INVALID;++n)
1.38 bar.set(n, (*_level)[n] >= _el);
1.39 @@ -712,7 +712,7 @@
1.40
1.41 ///Check if the found flow is a feasible circulation,
1.42 ///
1.43 - bool checkFlow() {
1.44 + bool checkFlow() const {
1.45 for(ArcIt e(_g);e!=INVALID;++e)
1.46 if((*_flow)[e]<(*_lo)[e]||(*_flow)[e]>(*_up)[e]) return false;
1.47 for(NodeIt n(_g);n!=INVALID;++n)
1.48 @@ -730,7 +730,7 @@
1.49 ///Check whether or not the last execution provides a barrier.
1.50 ///\sa barrier()
1.51 ///\sa barrierMap()
1.52 - bool checkBarrier()
1.53 + bool checkBarrier() const
1.54 {
1.55 Value delta=0;
1.56 for(NodeIt n(_g);n!=INVALID;++n)