Changeset 835:c92296660262 in lemon for lemon/dfs.h
 Timestamp:
 11/18/09 14:38:02 (11 years ago)
 Branch:
 default
 Parents:
 834:c2230649a493 (diff), 833:e20173729589 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.  Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dfs.h
r833 r835 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. 
lemon/dfs.h
r834 r835 64 64 ///The type of the map that indicates which nodes are processed. 65 65 ///It must conform to the \ref concepts::WriteMap "WriteMap" concept. 66 ///By default it is a NullMap.66 ///By default, it is a NullMap. 67 67 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 68 68 ///Instantiates a \c ProcessedMap. … … 779 779 ///The type of the map that indicates which nodes are processed. 780 780 ///It must conform to the \ref concepts::WriteMap "WriteMap" concept. 781 ///By default it is a NullMap.781 ///By default, it is a NullMap. 782 782 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 783 783 ///Instantiates a ProcessedMap.
Note: See TracChangeset
for help on using the changeset viewer.