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