1.1 --- a/src/lemon/dfs.h	Wed Mar 16 13:25:19 2005 +0000
     1.2 +++ b/src/lemon/dfs.h	Wed Mar 16 16:40:21 2005 +0000
     1.3 @@ -431,6 +431,40 @@
     1.4        return *this;
     1.5      }
     1.6  
     1.7 +    ///Sets the map indicating if a node is reached.
     1.8 +
     1.9 +    ///Sets the map indicating if a node is reached.
    1.10 +    ///If you don't use this function before calling \ref run(),
    1.11 +    ///it will allocate one. The destuctor deallocates this
    1.12 +    ///automatically allocated map, of course.
    1.13 +    ///\return <tt> (*this) </tt>
    1.14 +    Dfs &reachedMap(ReachedMap &m) 
    1.15 +    {
    1.16 +      if(local_reached) {
    1.17 +	delete _reached;
    1.18 +	local_reached=false;
    1.19 +      }
    1.20 +      _reached = &m;
    1.21 +      return *this;
    1.22 +    }
    1.23 +
    1.24 +    ///Sets the map indicating if a node is processed.
    1.25 +
    1.26 +    ///Sets the map indicating if a node is processed.
    1.27 +    ///If you don't use this function before calling \ref run(),
    1.28 +    ///it will allocate one. The destuctor deallocates this
    1.29 +    ///automatically allocated map, of course.
    1.30 +    ///\return <tt> (*this) </tt>
    1.31 +    Dfs &processedMap(ProcessedMap &m) 
    1.32 +    {
    1.33 +      if(local_processed) {
    1.34 +	delete _processed;
    1.35 +	local_processed=false;
    1.36 +      }
    1.37 +      _processed = &m;
    1.38 +      return *this;
    1.39 +    }
    1.40 +
    1.41    public:
    1.42      ///\name Execution control
    1.43      ///The simplest way to execute the algorithm is to use