Changes in lemon/bfs.h [716:f47b6c94577e:717:684964884a2e] in lemon-1.2
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bfs.h
r716 r717 415 415 ///The simplest way to execute the BFS algorithm is to use one of the 416 416 ///member functions called \ref run(Node) "run()".\n 417 ///If you need more control on the execution, firstyou have to call418 ///\ref init() , then you can add several source nodes with417 ///If you need better control on the execution, you have to call 418 ///\ref init() first, then you can add several source nodes with 419 419 ///\ref addSource(). Finally the actual path computation can be 420 420 ///performed with one of the \ref start() functions. … … 1423 1423 /// The simplest way to execute the BFS algorithm is to use one of the 1424 1424 /// member functions called \ref run(Node) "run()".\n 1425 /// If you need more control on the execution, firstyou have to call1426 /// \ref init() , then you can add several source nodes with1425 /// If you need better control on the execution, you have to call 1426 /// \ref init() first, then you can add several source nodes with 1427 1427 /// \ref addSource(). Finally the actual path computation can be 1428 1428 /// performed with one of the \ref start() functions.
Note: See TracChangeset
for help on using the changeset viewer.