equal
deleted
inserted
replaced
555 /// |
555 /// |
556 ///\pre init() must be called and a root node should be |
556 ///\pre init() must be called and a root node should be |
557 ///added with addSource() before using this function. |
557 ///added with addSource() before using this function. |
558 void start(Node t) |
558 void start(Node t) |
559 { |
559 { |
560 while ( !emptyQueue() && G->target(_stack[_stack_head])!=t ) |
560 while ( !emptyQueue() && !(*_reached)[t] ) |
561 processNextArc(); |
561 processNextArc(); |
562 } |
562 } |
563 |
563 |
564 ///Executes the algorithm until a condition is met. |
564 ///Executes the algorithm until a condition is met. |
565 |
565 |
1507 /// - the distance of \c t from the root in the %DFS tree. |
1507 /// - the distance of \c t from the root in the %DFS tree. |
1508 /// |
1508 /// |
1509 /// \pre init() must be called and a root node should be added |
1509 /// \pre init() must be called and a root node should be added |
1510 /// with addSource() before using this function. |
1510 /// with addSource() before using this function. |
1511 void start(Node t) { |
1511 void start(Node t) { |
1512 while ( !emptyQueue() && _digraph->target(_stack[_stack_head]) != t ) |
1512 while ( !emptyQueue() && !(*_reached)[t] ) |
1513 processNextArc(); |
1513 processNextArc(); |
1514 } |
1514 } |
1515 |
1515 |
1516 /// \brief Executes the algorithm until a condition is met. |
1516 /// \brief Executes the algorithm until a condition is met. |
1517 /// |
1517 /// |