Changes in lemon/bfs.h [760:4ac30454f1c1:525:9605e051942f] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bfs.h
r760 r525 414 414 ///The simplest way to execute the BFS algorithm is to use one of the 415 415 ///member functions called \ref run(Node) "run()".\n 416 ///If you need better control on the execution,you have to call417 ///\ref init() first, then you can add several source nodes with416 ///If you need more control on the execution, first you have to call 417 ///\ref init(), then you can add several source nodes with 418 418 ///\ref addSource(). Finally the actual path computation can be 419 419 ///performed with one of the \ref start() functions. … … 1426 1426 /// The simplest way to execute the BFS algorithm is to use one of the 1427 1427 /// member functions called \ref run(Node) "run()".\n 1428 /// If you need better control on the execution,you have to call1429 /// \ref init() first, then you can add several source nodes with1428 /// If you need more control on the execution, first you have to call 1429 /// \ref init(), then you can add several source nodes with 1430 1430 /// \ref addSource(). Finally the actual path computation can be 1431 1431 /// performed with one of the \ref start() functions.
Note: See TracChangeset
for help on using the changeset viewer.