1.1 --- a/lemon/bfs.h	Tue Dec 02 15:33:22 2008 +0000
     1.2 +++ b/lemon/bfs.h	Fri Dec 05 00:22:47 2008 +0100
     1.3 @@ -1741,7 +1741,7 @@
     1.4      ///
     1.5      /// \pre Either \ref run(Node) "run()" or \ref init()
     1.6      /// must be called before using this function.
     1.7 -    bool reached(Node v) { return (*_reached)[v]; }
     1.8 +    bool reached(Node v) const { return (*_reached)[v]; }
     1.9  
    1.10      ///@}
    1.11  

     2.1 --- a/lemon/circulation.h	Tue Dec 02 15:33:22 2008 +0000
     2.2 +++ b/lemon/circulation.h	Fri Dec 05 00:22:47 2008 +0100
     2.3 @@ -419,7 +419,7 @@
     2.4      ///
     2.5      /// \pre Either \ref run() or \ref init() must be called before
     2.6      /// using this function.
     2.7 -    const Elevator& elevator() {
     2.8 +    const Elevator& elevator() const {
     2.9        return *_level;
    2.10      }
    2.11  
    2.12 @@ -644,7 +644,7 @@
    2.13      ///
    2.14      /// \pre Either \ref run() or \ref init() must be called before
    2.15      /// using this function.
    2.16 -    const FlowMap& flowMap() {
    2.17 +    const FlowMap& flowMap() const {
    2.18        return *_flow;
    2.19      }
    2.20  
    2.21 @@ -669,7 +669,7 @@
    2.22         \sa barrierMap()
    2.23         \sa checkBarrier()
    2.24      */
    2.25 -    bool barrier(const Node& node)
    2.26 +    bool barrier(const Node& node) const
    2.27      {
    2.28        return (*_level)[node] >= _el;
    2.29      }
    2.30 @@ -692,7 +692,7 @@
    2.31      /// \sa barrier()
    2.32      /// \sa checkBarrier()
    2.33      template<class BarrierMap>
    2.34 -    void barrierMap(BarrierMap &bar)
    2.35 +    void barrierMap(BarrierMap &bar) const
    2.36      {
    2.37        for(NodeIt n(_g);n!=INVALID;++n)
    2.38          bar.set(n, (*_level)[n] >= _el);
    2.39 @@ -712,7 +712,7 @@
    2.40  
    2.41      ///Check if the found flow is a feasible circulation,
    2.42      ///
    2.43 -    bool checkFlow() {
    2.44 +    bool checkFlow() const {
    2.45        for(ArcIt e(_g);e!=INVALID;++e)
    2.46          if((*_flow)[e]<(*_lo)[e]||(*_flow)[e]>(*_up)[e]) return false;
    2.47        for(NodeIt n(_g);n!=INVALID;++n)
    2.48 @@ -730,7 +730,7 @@
    2.49      ///Check whether or not the last execution provides a barrier.
    2.50      ///\sa barrier()
    2.51      ///\sa barrierMap()
    2.52 -    bool checkBarrier()
    2.53 +    bool checkBarrier() const
    2.54      {
    2.55        Value delta=0;
    2.56        for(NodeIt n(_g);n!=INVALID;++n)

     3.1 --- a/lemon/dfs.h	Tue Dec 02 15:33:22 2008 +0000
     3.2 +++ b/lemon/dfs.h	Fri Dec 05 00:22:47 2008 +0100
     3.3 @@ -1625,7 +1625,7 @@
     3.4      ///
     3.5      /// \pre Either \ref run(Node) "run()" or \ref init()
     3.6      /// must be called before using this function.
     3.7 -    bool reached(Node v) { return (*_reached)[v]; }
     3.8 +    bool reached(Node v) const { return (*_reached)[v]; }
     3.9  
    3.10      ///@}
    3.11  

     4.1 --- a/lemon/preflow.h	Tue Dec 02 15:33:22 2008 +0000
     4.2 +++ b/lemon/preflow.h	Fri Dec 05 00:22:47 2008 +0100
     4.3 @@ -366,7 +366,7 @@
     4.4      ///
     4.5      /// \pre Either \ref run() or \ref init() must be called before
     4.6      /// using this function.
     4.7 -    const Elevator& elevator() {
     4.8 +    const Elevator& elevator() const {
     4.9        return *_level;
    4.10      }
    4.11  
    4.12 @@ -918,7 +918,7 @@
    4.13      ///
    4.14      /// \pre Either \ref run() or \ref init() must be called before
    4.15      /// using this function.
    4.16 -    const FlowMap& flowMap() {
    4.17 +    const FlowMap& flowMap() const {
    4.18        return *_flow;
    4.19      }
    4.20