Changeset 787:c2230649a493 in lemon1.2 for lemon/dfs.h
 Timestamp:
 11/15/09 19:57:02 (10 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dfs.h
r717 r787 634 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 637 ///%DFS path to each node. 638 /// 639 ///The algorithm computes 640 /// the %DFS tree (forest), 641 /// the distance of each node from the root(s) in the %DFS tree. 636 ///This method runs the %DFS algorithm in order to visit all nodes 637 ///in the digraph. 642 638 /// 643 639 ///\note <tt>d.run()</tt> is just a shortcut of the following code. … … 977 973 ///Runs DFS algorithm to visit all nodes in the digraph. 978 974 979 ///This method runs DFS algorithm in order to compute980 /// the DFS path to each node.975 ///This method runs DFS algorithm in order to visit all nodes 976 ///in the digraph. 981 977 void run() 982 978 { … … 1579 1575 /// \brief Runs the algorithm to visit all nodes in the digraph. 1580 1576 1581 /// This method runs the %DFS algorithm in order to 1582 /// compute the %DFS path to each node. 1583 /// 1584 /// The algorithm computes 1585 ///  the %DFS tree (forest), 1586 ///  the distance of each node from the root(s) in the %DFS tree. 1577 /// This method runs the %DFS algorithm in order to visit all nodes 1578 /// in the digraph. 1587 1579 /// 1588 1580 /// \note <tt>d.run()</tt> is just a shortcut of the following code.
Note: See TracChangeset
for help on using the changeset viewer.