0
4
0
... | ... |
@@ -452,5 +452,6 @@ |
452 | 452 |
|
453 |
/// \brief Sets the tolerance used by algorithm. |
|
453 |
/// \brief Sets the tolerance used by the algorithm. |
|
454 | 454 |
/// |
455 |
/// Sets the tolerance used by algorithm. |
|
455 |
/// Sets the tolerance object used by the algorithm. |
|
456 |
/// \return <tt>(*this)</tt> |
|
456 | 457 |
Circulation& tolerance(const Tolerance& tolerance) { |
... | ... |
@@ -462,3 +463,4 @@ |
462 | 463 |
/// |
463 |
/// Returns a const reference to the tolerance |
|
464 |
/// Returns a const reference to the tolerance object used by |
|
465 |
/// the algorithm. |
|
464 | 466 |
const Tolerance& tolerance() const { |
... | ... |
@@ -99,3 +99,3 @@ |
99 | 99 |
/// The preflow algorithms are the fastest known maximum |
100 |
/// flow algorithms. The current implementation |
|
100 |
/// flow algorithms. The current implementation uses a mixture of the |
|
101 | 101 |
/// \e "highest label" and the \e "bound decrease" heuristics. |
... | ... |
@@ -373,5 +373,6 @@ |
373 | 373 |
|
374 |
/// \brief Sets the tolerance used by algorithm. |
|
374 |
/// \brief Sets the tolerance used by the algorithm. |
|
375 | 375 |
/// |
376 |
/// Sets the tolerance used by algorithm. |
|
376 |
/// Sets the tolerance object used by the algorithm. |
|
377 |
/// \return <tt>(*this)</tt> |
|
377 | 378 |
Preflow& tolerance(const Tolerance& tolerance) { |
... | ... |
@@ -383,3 +384,4 @@ |
383 | 384 |
/// |
384 |
/// Returns a const reference to the tolerance |
|
385 |
/// Returns a const reference to the tolerance object used by |
|
386 |
/// the algorithm. |
|
385 | 387 |
const Tolerance& tolerance() const { |
0 comments (0 inline)