equal
deleted
inserted
replaced
548 ///with addSource() before using this function. |
548 ///with addSource() before using this function. |
549 /// |
549 /// |
550 ///\param nm must be a bool (or convertible) node map. The algorithm |
550 ///\param nm must be a bool (or convertible) node map. The algorithm |
551 ///will stop when it reaches a node \c v with <tt>nm[v]==true</tt>. |
551 ///will stop when it reaches a node \c v with <tt>nm[v]==true</tt>. |
552 template<class NM> |
552 template<class NM> |
553 void start(const NM &nm) |
553 void start(const NM &nm) |
554 { |
554 { |
555 while ( !emptyQueue() && !nm[_queue[_queue_tail]] ) processNextNode(); |
555 while ( !emptyQueue() && !nm[_queue[_queue_tail]] ) processNextNode(); |
556 } |
556 } |
557 |
557 |
558 ///Runs %BFS algorithm from node \c s. |
558 ///Runs %BFS algorithm from node \c s. |
559 |
559 |
560 ///This method runs the %BFS algorithm from a root node \c s |
560 ///This method runs the %BFS algorithm from a root node \c s |
561 ///in order to |
561 ///in order to |