diff options
author | Gard Spreemann <gspreemann@gmail.com> | 2018-02-02 13:51:45 +0100 |
---|---|---|
committer | Gard Spreemann <gspreemann@gmail.com> | 2018-02-02 13:51:45 +0100 |
commit | 9899ae167f281d10b1684dfcd02c6838c5bf28df (patch) | |
tree | ceda62a40a9a8f731298832b1b4ab44ab0dd3a10 /include/gudhi/Bottleneck.h | |
parent | 866f6ce614e9c09c97fed12c8c0c2c9fb84fad3f (diff) |
GUDHI 2.1.0 as released by upstream in a tarball.upstream/2.1.0
Diffstat (limited to 'include/gudhi/Bottleneck.h')
-rw-r--r-- | include/gudhi/Bottleneck.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/include/gudhi/Bottleneck.h b/include/gudhi/Bottleneck.h index 8c97dce9..7aee07bb 100644 --- a/include/gudhi/Bottleneck.h +++ b/include/gudhi/Bottleneck.h @@ -46,7 +46,7 @@ double bottleneck_distance_approx(Persistence_graph& g, double e) { if (step <= b_lower_bound || step >= b_upper_bound) // Avoid precision problem break; m.set_r(step); - while (m.multi_augment()) {}; // compute a maximum matching (in the graph corresponding to the current r) + while (m.multi_augment()) {} // compute a maximum matching (in the graph corresponding to the current r) if (m.perfect()) { m = biggest_unperfect; b_upper_bound = step; @@ -68,7 +68,7 @@ double bottleneck_distance_exact(Persistence_graph& g) { while (lower_bound_i != upper_bound_i) { long step = lower_bound_i + static_cast<long> ((upper_bound_i - lower_bound_i - 1) / alpha); m.set_r(sd.at(step)); - while (m.multi_augment()) {}; // compute a maximum matching (in the graph corresponding to the current r) + while (m.multi_augment()) {} // compute a maximum matching (in the graph corresponding to the current r) if (m.perfect()) { m = biggest_unperfect; upper_bound_i = step; |