Changes in lemon/bfs.h [833:e20173729589:835:c92296660262] in lemon
 File:

 1 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.
Note: See TracChangeset
for help on using the changeset viewer.