From def05e2da637a43c02e439af8faaf789214395cd Mon Sep 17 00:00:00 2001
From: salinasd <salinasd@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Tue, 10 Feb 2015 17:03:43 +0000
Subject: skbl correction bug constructor + contraction add garland heckbert
 example

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@466 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 1789e903625df3c4e7c689fa4888bebd86e616eb
---
 .../example/Skeleton_blocker_link.cpp              | 71 ++++++++++++++++++++++
 1 file changed, 71 insertions(+)
 create mode 100644 src/Skeleton_blocker/example/Skeleton_blocker_link.cpp

(limited to 'src/Skeleton_blocker/example/Skeleton_blocker_link.cpp')

diff --git a/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp b/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp
new file mode 100644
index 00000000..0987cc89
--- /dev/null
+++ b/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp
@@ -0,0 +1,71 @@
+ /*    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):       David Salinas
+  *
+  *    Copyright (C) 2014  INRIA Sophia Antipolis-Mediterranee (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 <stdio.h>
+#include <stdlib.h>
+#include <string>
+#include <fstream>
+#include <sstream>
+
+
+#include "gudhi/Skeleton_blocker.h"
+
+using namespace std;
+using namespace Gudhi;
+using namespace skbl;
+
+typedef Skeleton_blocker_complex<Skeleton_blocker_simple_traits> Complex;
+typedef Complex::Vertex_handle Vertex_handle;
+typedef Complex::Root_vertex_handle Root_vertex_handle;
+typedef Complex::Simplex_handle Simplex;
+
+
+int main (int argc, char *argv[]){
+	// build a full complex with 4 vertices and 2^4-1 simplices
+	// Initial vertices are (0,1,2,3,4)
+	Simplex tetrahedron(Vertex_handle(0),Vertex_handle(1),Vertex_handle(2),Vertex_handle(3));
+	Complex complex;
+	complex.add_simplex(tetrahedron);
+
+	cout<<"complex:"<<complex.to_string()<<endl;
+
+	//build the link of vertex 1, eg a triangle {0,2,3}
+	auto link = complex.link(Vertex_handle(1));
+	cout<<"link:"<<link.to_string()<<endl;
+
+	//Internally link is a subcomplex of 'complex' and its vertices are stored in a vector.
+	//They can be accessed via Vertex_handle(x) where x is an index of the vector.
+	//In that example, link has three vertices and thus it contains only
+	// Vertex_handle(0),Vertex_handle(1) and Vertex_handle(2) are).
+	for(int i = 0; i<5; ++i)
+		cout << "link.contains_vertex(Vertex_handle("<<i<<")):"<<link.contains_vertex(Vertex_handle(i))<<endl;
+	cout<<endl;
+
+	//To access to the initial vertices eg (0,1,2,3,4),  Root_vertex_handle must be used.
+	//For instance, to test if the link contains the vertex that was labeled i:
+	for(int i = 0; i<5; ++i)
+		cout << "link.contains_vertex(Root_vertex_handle("<<i<<")):"<<link.contains_vertex(Root_vertex_handle(i))<<endl;
+
+	return EXIT_SUCCESS;
+}
+
-- 
cgit v1.2.3