Changeset 835:c92296660262 in lemon for lemon/bfs.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/bfs.h
r833 r835 702 702 ///Runs the algorithm to visit all nodes in the digraph. 703 703 704 ///This method runs the %BFS algorithm in order to 705 ///compute the shortest path to each node. 706 /// 707 ///The algorithm computes 708 /// the shortest path tree (forest), 709 /// the distance of each node from the root(s). 704 ///This method runs the %BFS algorithm in order to visit all nodes 705 ///in the digraph. 710 706 /// 711 707 ///\note <tt>b.run(s)</tt> is just a shortcut of the following code. … … 1047 1043 ///Runs BFS algorithm to visit all nodes in the digraph. 1048 1044 1049 ///This method runs BFS algorithm in order to compute1050 /// the shortest path to each node.1045 ///This method runs BFS algorithm in order to visit all nodes 1046 ///in the digraph. 1051 1047 void run() 1052 1048 { … … 1696 1692 /// \brief Runs the algorithm to visit all nodes in the digraph. 1697 1693 /// 1698 /// This method runs the %BFS algorithm in order to 1699 /// compute the shortest path to each node. 1700 /// 1701 /// The algorithm computes 1702 ///  the shortest path tree (forest), 1703 ///  the distance of each node from the root(s). 1694 /// This method runs the %BFS algorithm in order to visit all nodes 1695 /// in the digraph. 1704 1696 /// 1705 1697 /// \note <tt>b.run(s)</tt> is just a shortcut of the following code. 
lemon/bfs.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. … … 849 849 ///The type of the map that indicates which nodes are processed. 850 850 ///It must conform to the \ref concepts::WriteMap "WriteMap" concept. 851 ///By default it is a NullMap.851 ///By default, it is a NullMap. 852 852 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 853 853 ///Instantiates a ProcessedMap.
Note: See TracChangeset
for help on using the changeset viewer.