0
3
0
| ... | ... |
@@ -396,26 +396,26 @@ |
| 396 | 396 |
/// The results of the algorithm can be obtained using these |
| 397 | 397 |
/// functions.\n |
| 398 | 398 |
/// The algorithm should be executed before using them. |
| 399 | 399 |
|
| 400 | 400 |
/// @{
|
| 401 | 401 |
|
| 402 | 402 |
/// \brief Return the total length of the found cycle. |
| 403 | 403 |
/// |
| 404 | 404 |
/// This function returns the total length of the found cycle. |
| 405 | 405 |
/// |
| 406 | 406 |
/// \pre \ref run() or \ref findMinMean() must be called before |
| 407 | 407 |
/// using this function. |
| 408 |
LargeValue cycleLength() const {
|
|
| 409 |
return _best_length; |
|
| 408 |
Value cycleLength() const {
|
|
| 409 |
return static_cast<Value>(_best_length); |
|
| 410 | 410 |
} |
| 411 | 411 |
|
| 412 | 412 |
/// \brief Return the number of arcs on the found cycle. |
| 413 | 413 |
/// |
| 414 | 414 |
/// This function returns the number of arcs on the found cycle. |
| 415 | 415 |
/// |
| 416 | 416 |
/// \pre \ref run() or \ref findMinMean() must be called before |
| 417 | 417 |
/// using this function. |
| 418 | 418 |
int cycleArcNum() const {
|
| 419 | 419 |
return _best_size; |
| 420 | 420 |
} |
| 421 | 421 |
| ... | ... |
@@ -375,26 +375,26 @@ |
| 375 | 375 |
/// The results of the algorithm can be obtained using these |
| 376 | 376 |
/// functions.\n |
| 377 | 377 |
/// The algorithm should be executed before using them. |
| 378 | 378 |
|
| 379 | 379 |
/// @{
|
| 380 | 380 |
|
| 381 | 381 |
/// \brief Return the total length of the found cycle. |
| 382 | 382 |
/// |
| 383 | 383 |
/// This function returns the total length of the found cycle. |
| 384 | 384 |
/// |
| 385 | 385 |
/// \pre \ref run() or \ref findMinMean() must be called before |
| 386 | 386 |
/// using this function. |
| 387 |
LargeValue cycleLength() const {
|
|
| 388 |
return _best_length; |
|
| 387 |
Value cycleLength() const {
|
|
| 388 |
return static_cast<Value>(_best_length); |
|
| 389 | 389 |
} |
| 390 | 390 |
|
| 391 | 391 |
/// \brief Return the number of arcs on the found cycle. |
| 392 | 392 |
/// |
| 393 | 393 |
/// This function returns the number of arcs on the found cycle. |
| 394 | 394 |
/// |
| 395 | 395 |
/// \pre \ref run() or \ref findMinMean() must be called before |
| 396 | 396 |
/// using this function. |
| 397 | 397 |
int cycleArcNum() const {
|
| 398 | 398 |
return _best_size; |
| 399 | 399 |
} |
| 400 | 400 |
| ... | ... |
@@ -383,26 +383,26 @@ |
| 383 | 383 |
/// The results of the algorithm can be obtained using these |
| 384 | 384 |
/// functions.\n |
| 385 | 385 |
/// The algorithm should be executed before using them. |
| 386 | 386 |
|
| 387 | 387 |
/// @{
|
| 388 | 388 |
|
| 389 | 389 |
/// \brief Return the total length of the found cycle. |
| 390 | 390 |
/// |
| 391 | 391 |
/// This function returns the total length of the found cycle. |
| 392 | 392 |
/// |
| 393 | 393 |
/// \pre \ref run() or \ref findMinMean() must be called before |
| 394 | 394 |
/// using this function. |
| 395 |
LargeValue cycleLength() const {
|
|
| 396 |
return _cycle_length; |
|
| 395 |
Value cycleLength() const {
|
|
| 396 |
return static_cast<Value>(_cycle_length); |
|
| 397 | 397 |
} |
| 398 | 398 |
|
| 399 | 399 |
/// \brief Return the number of arcs on the found cycle. |
| 400 | 400 |
/// |
| 401 | 401 |
/// This function returns the number of arcs on the found cycle. |
| 402 | 402 |
/// |
| 403 | 403 |
/// \pre \ref run() or \ref findMinMean() must be called before |
| 404 | 404 |
/// using this function. |
| 405 | 405 |
int cycleArcNum() const {
|
| 406 | 406 |
return _cycle_size; |
| 407 | 407 |
} |
| 408 | 408 |
|
0 comments (0 inline)