equal
deleted
inserted
replaced
508 _processed->set(v,true); |
508 _processed->set(v,true); |
509 _dist->set(v, dst); |
509 _dist->set(v, dst); |
510 } |
510 } |
511 |
511 |
512 public: |
512 public: |
|
513 |
|
514 typedef PredMapPath<Graph, PredMap> Path; |
|
515 |
513 ///\name Execution control |
516 ///\name Execution control |
514 ///The simplest way to execute the algorithm is to use |
517 ///The simplest way to execute the algorithm is to use |
515 ///one of the member functions called \c run(...). |
518 ///one of the member functions called \c run(...). |
516 ///\n |
519 ///\n |
517 ///If you need more control on the execution, |
520 ///If you need more control on the execution, |
717 ///Before the use of these functions, |
720 ///Before the use of these functions, |
718 ///either run() or start() must be called. |
721 ///either run() or start() must be called. |
719 |
722 |
720 ///@{ |
723 ///@{ |
721 |
724 |
722 typedef PredMapPath<Graph, PredMap> Path; |
|
723 |
|
724 ///Gives back the shortest path. |
725 ///Gives back the shortest path. |
725 |
726 |
726 ///Gives back the shortest path. |
727 ///Gives back the shortest path. |
727 ///\pre The \c t should be reachable from the source. |
728 ///\pre The \c t should be reachable from the source. |
728 Path path(Node t) |
729 Path path(Node t) |