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