summaryrefslogtreecommitdiff
path: root/example/Bottleneck_distance/bottleneck_basic_example.cpp
diff options
context:
space:
mode:
authorGard Spreemann <gspr@nonempty.org>2019-09-25 14:53:36 +0200
committerGard Spreemann <gspr@nonempty.org>2019-09-25 14:53:36 +0200
commit70ad5fc411b0e0a3d590ad281fc97d488994062b (patch)
treeb0ddd84d7ee935936787eee2b75f78f2e21c41f0 /example/Bottleneck_distance/bottleneck_basic_example.cpp
parentb50046e487ab42cdef19b02128a9f498d6a36482 (diff)
parent5ccee32ec2ba38743c6b96867db3e1b5151e45e4 (diff)
Merge branch 'dfsg/latest' into debian/sid
Diffstat (limited to 'example/Bottleneck_distance/bottleneck_basic_example.cpp')
-rw-r--r--example/Bottleneck_distance/bottleneck_basic_example.cpp50
1 files changed, 0 insertions, 50 deletions
diff --git a/example/Bottleneck_distance/bottleneck_basic_example.cpp b/example/Bottleneck_distance/bottleneck_basic_example.cpp
deleted file mode 100644
index 3df7d12d..00000000
--- a/example/Bottleneck_distance/bottleneck_basic_example.cpp
+++ /dev/null
@@ -1,50 +0,0 @@
-/* This file is part of the Gudhi Library. The Gudhi library
- * (Geometric Understanding in Higher Dimensions) is a generic C++
- * library for computational topology.
- *
- * Authors: Francois Godi, small modifications by Pawel Dlotko
- *
- * Copyright (C) 2015 Inria
- *
- * This program is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program. If not, see <http://www.gnu.org/licenses/>.
- */
-
-#include <gudhi/Bottleneck.h>
-
-#include <iostream>
-#include <vector>
-#include <utility> // for pair
-#include <limits> // for numeric_limits
-
-int main() {
- std::vector< std::pair<double, double> > v1, v2;
-
- v1.emplace_back(2.7, 3.7);
- v1.emplace_back(9.6, 14.);
- v1.emplace_back(34.2, 34.974);
- v1.emplace_back(3., std::numeric_limits<double>::infinity());
-
- v2.emplace_back(2.8, 4.45);
- v2.emplace_back(9.5, 14.1);
- v2.emplace_back(3.2, std::numeric_limits<double>::infinity());
-
-
- double b = Gudhi::persistence_diagram::bottleneck_distance(v1, v2);
-
- std::cout << "Bottleneck distance = " << b << std::endl;
-
- b = Gudhi::persistence_diagram::bottleneck_distance(v1, v2, 0.1);
-
- std::cout << "Approx bottleneck distance = " << b << std::endl;
-}