Debian Codegraph @

src/Bottleneck_distance/example/bottleneck_basic_example.cpp

raw
1 #include <gudhi/Bottleneck.h>
2
3 #include <iostream>
4 #include <vector>
5 #include <utility> // for pair
6 #include <limits> // for numeric_limits
7
8 int main() {
9 std::vector< std::pair<double, double> > v1, v2;
10
11 v1.emplace_back(2.7, 3.7);
12 v1.emplace_back(9.6, 14.);
13 v1.emplace_back(34.2, 34.974);
14 v1.emplace_back(3., std::numeric_limits<double>::infinity());
15
16 v2.emplace_back(2.8, 4.45);
17 v2.emplace_back(9.5, 14.1);
18 v2.emplace_back(3.2, std::numeric_limits<double>::infinity());
19
20
21 double b = Gudhi::persistence_diagram::bottleneck_distance(v1, v2);
22
23 std::clog << "Bottleneck distance = " << b << std::endl;
24
25 b = Gudhi::persistence_diagram::bottleneck_distance(v1, v2, 0.1);
26
27 std::clog << "Approx bottleneck distance = " << b << std::endl;
28 }