1.1 --- a/lemon/bfs.h	Wed Nov 02 15:27:38 2005 +0000
     1.2 +++ b/lemon/bfs.h	Wed Nov 02 15:28:37 2005 +0000
     1.3 @@ -550,10 +550,10 @@
     1.4      ///\param nm must be a bool (or convertible) node map. The algorithm
     1.5      ///will stop when it reaches a node \c v with <tt>nm[v]==true</tt>.
     1.6      template<class NM>
     1.7 -      void start(const NM &nm)
     1.8 -      {
     1.9 -	while ( !emptyQueue() && !nm[_queue[_queue_tail]] ) processNextNode();
    1.10 -      }
    1.11 +    void start(const NM &nm)
    1.12 +    {
    1.13 +      while ( !emptyQueue() && !nm[_queue[_queue_tail]] ) processNextNode();
    1.14 +    }
    1.15      
    1.16      ///Runs %BFS algorithm from node \c s.
    1.17