(v = _graph.target(_policy[v])) != _cycle_node; ) {

             (v = _graph.target(_policy[v])) != _cycle_node; ) {

         _cycle_path->addBack(_policy[v]);

         _cycle_path->addBack(_policy[v]);

       }

       }

       return true;

       return true;

     }

     }

     /// @}

     /// @}

     /// \name Query Functions

     /// \name Query Functions

     /// The result of the algorithm can be obtained using these

     /// The result of the algorithm can be obtained using these

     /// functions.

     /// functions.

     /// \n The algorithm should be executed before using them.

     /// \n The algorithm should be executed before using them.

     /// @{

     /// @{

     /// \brief Returns the total length of the found cycle.

     /// \brief Returns the total length of the found cycle.

     ///

     ///

     /// Returns the total length of the found cycle.

     /// Returns the total length of the found cycle.

     ///

     ///

     /// \pre \ref run() or \ref findMinMean() must be called before

     /// \pre \ref run() or \ref findMinMean() must be called before

     ///

     ///

     /// \sa cyclePath()

     /// \sa cyclePath()

     const Path& cycle() const {

     const Path& cycle() const {

       return *_cycle_path;

       return *_cycle_path;

     }

     }

     ///@}

     ///@}

   private:

   private:

     // Initializes the internal data structures for the current strongly

     // Initializes the internal data structures for the current strongly

     // connected component and creating the policy graph.

     // connected component and creating the policy graph.

     // The policy graph can be represented by the _policy map because

     // The policy graph can be represented by the _policy map because