equal
deleted
inserted
replaced
251 /// |
251 /// |
252 /// \note The algorithm calls only the \ref lemon::Path::addBack() |
252 /// \note The algorithm calls only the \ref lemon::Path::addBack() |
253 /// "addBack()" function of the given path structure. |
253 /// "addBack()" function of the given path structure. |
254 /// |
254 /// |
255 /// \return <tt>(*this)</tt> |
255 /// \return <tt>(*this)</tt> |
256 /// |
256 MinMeanCycle& cycle(Path &path) { |
257 /// \sa cycle() |
|
258 MinMeanCycle& cyclePath(Path &path) { |
|
259 if (_local_path) { |
257 if (_local_path) { |
260 delete _cycle_path; |
258 delete _cycle_path; |
261 _local_path = false; |
259 _local_path = false; |
262 } |
260 } |
263 _cycle_path = &path; |
261 _cycle_path = &path; |
387 /// This function returns a const reference to the path structure |
385 /// This function returns a const reference to the path structure |
388 /// storing the found cycle. |
386 /// storing the found cycle. |
389 /// |
387 /// |
390 /// \pre \ref run() or \ref findCycle() must be called before using |
388 /// \pre \ref run() or \ref findCycle() must be called before using |
391 /// this function. |
389 /// this function. |
392 /// |
|
393 /// \sa cyclePath() |
|
394 const Path& cycle() const { |
390 const Path& cycle() const { |
395 return *_cycle_path; |
391 return *_cycle_path; |
396 } |
392 } |
397 |
393 |
398 ///@} |
394 ///@} |