equal
deleted
inserted
replaced
631 return reached(t); |
631 return reached(t); |
632 } |
632 } |
633 |
633 |
634 ///Runs the algorithm to visit all nodes in the digraph. |
634 ///Runs the algorithm to visit all nodes in the digraph. |
635 |
635 |
636 ///This method runs the %DFS algorithm in order to compute the |
636 ///This method runs the %DFS algorithm in order to visit all nodes |
637 ///%DFS path to each node. |
637 ///in the digraph. |
638 /// |
|
639 ///The algorithm computes |
|
640 ///- the %DFS tree (forest), |
|
641 ///- the distance of each node from the root(s) in the %DFS tree. |
|
642 /// |
638 /// |
643 ///\note <tt>d.run()</tt> is just a shortcut of the following code. |
639 ///\note <tt>d.run()</tt> is just a shortcut of the following code. |
644 ///\code |
640 ///\code |
645 /// d.init(); |
641 /// d.init(); |
646 /// for (NodeIt n(digraph); n != INVALID; ++n) { |
642 /// for (NodeIt n(digraph); n != INVALID; ++n) { |
974 return alg.reached(t); |
970 return alg.reached(t); |
975 } |
971 } |
976 |
972 |
977 ///Runs DFS algorithm to visit all nodes in the digraph. |
973 ///Runs DFS algorithm to visit all nodes in the digraph. |
978 |
974 |
979 ///This method runs DFS algorithm in order to compute |
975 ///This method runs DFS algorithm in order to visit all nodes |
980 ///the DFS path to each node. |
976 ///in the digraph. |
981 void run() |
977 void run() |
982 { |
978 { |
983 run(INVALID); |
979 run(INVALID); |
984 } |
980 } |
985 |
981 |
1576 return reached(t); |
1572 return reached(t); |
1577 } |
1573 } |
1578 |
1574 |
1579 /// \brief Runs the algorithm to visit all nodes in the digraph. |
1575 /// \brief Runs the algorithm to visit all nodes in the digraph. |
1580 |
1576 |
1581 /// This method runs the %DFS algorithm in order to |
1577 /// This method runs the %DFS algorithm in order to visit all nodes |
1582 /// compute the %DFS path to each node. |
1578 /// in the digraph. |
1583 /// |
|
1584 /// The algorithm computes |
|
1585 /// - the %DFS tree (forest), |
|
1586 /// - the distance of each node from the root(s) in the %DFS tree. |
|
1587 /// |
1579 /// |
1588 /// \note <tt>d.run()</tt> is just a shortcut of the following code. |
1580 /// \note <tt>d.run()</tt> is just a shortcut of the following code. |
1589 ///\code |
1581 ///\code |
1590 /// d.init(); |
1582 /// d.init(); |
1591 /// for (NodeIt n(digraph); n != INVALID; ++n) { |
1583 /// for (NodeIt n(digraph); n != INVALID; ++n) { |