1 files changed, 43 insertions, 0 deletions
diff --git a/src/Bottleneck_distance/example/bottleneck_example.cpp b/src/Bottleneck_distance/example/bottleneck_example.cpp
new file mode 100644
index 00000000..bbd83547
--- /dev/null
+++ b/src/Bottleneck_distance/example/bottleneck_example.cpp
@@ -0,0 +1,43 @@
+/*    This file is part of the Gudhi Library. The Gudhi library
+ *    (Geometric Understanding in Higher Dimensions) is a generic C++
+ *    library for computational topology.
+ *
+ *    Author(s):       Francois Godi
+ *
+ *    Copyright (C) 2015  INRIA Sophia-Antipolis (France)
+ *
+ *    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/Graph_matching.h>
+#include <iostream>
+
+using namespace Gudhi::Bottleneck_distance;
+
+int main() {
+    std::vector< std::pair<double,double> > v1, v2;
+
+    v1.push_back(std::pair<double,double>(2.7,3.7));
+    v1.push_back(std::pair<double,double>(9.6,14));
+    v1.push_back(std::pair<double,double>(34.2,34.974));
+
+    v2.push_back(std::pair<double,double>(2.8,4.45));
+    v2.push_back(std::pair<double,double>(9.5,14.1));
+
+
+    double b = bottleneck_distance(v1, v2);
+
+    std::cout << "Bottleneck distance = " << b << std::endl;
+
+}