equal
deleted
inserted
replaced
411 public: |
411 public: |
412 |
412 |
413 ///\name Execution Control |
413 ///\name Execution Control |
414 ///The simplest way to execute the BFS algorithm is to use one of the |
414 ///The simplest way to execute the BFS algorithm is to use one of the |
415 ///member functions called \ref run(Node) "run()".\n |
415 ///member functions called \ref run(Node) "run()".\n |
416 ///If you need more control on the execution, first you have to call |
416 ///If you need better control on the execution, you have to call |
417 ///\ref init(), then you can add several source nodes with |
417 ///\ref init() first, then you can add several source nodes with |
418 ///\ref addSource(). Finally the actual path computation can be |
418 ///\ref addSource(). Finally the actual path computation can be |
419 ///performed with one of the \ref start() functions. |
419 ///performed with one of the \ref start() functions. |
420 |
420 |
421 ///@{ |
421 ///@{ |
422 |
422 |
1423 public: |
1423 public: |
1424 |
1424 |
1425 /// \name Execution Control |
1425 /// \name Execution Control |
1426 /// The simplest way to execute the BFS algorithm is to use one of the |
1426 /// The simplest way to execute the BFS algorithm is to use one of the |
1427 /// member functions called \ref run(Node) "run()".\n |
1427 /// member functions called \ref run(Node) "run()".\n |
1428 /// If you need more control on the execution, first you have to call |
1428 /// If you need better control on the execution, you have to call |
1429 /// \ref init(), then you can add several source nodes with |
1429 /// \ref init() first, then you can add several source nodes with |
1430 /// \ref addSource(). Finally the actual path computation can be |
1430 /// \ref addSource(). Finally the actual path computation can be |
1431 /// performed with one of the \ref start() functions. |
1431 /// performed with one of the \ref start() functions. |
1432 |
1432 |
1433 /// @{ |
1433 /// @{ |
1434 |
1434 |