diff options
author | tlacombe <lacombe1993@gmail.com> | 2020-03-31 12:53:42 +0200 |
---|---|---|
committer | tlacombe <lacombe1993@gmail.com> | 2020-03-31 12:53:42 +0200 |
commit | e6c21aa957bbf66854f31824cd4313c61f7ea9fc (patch) | |
tree | 091c246f585e5836a2b1868414227d3d12938eaa /src/Skeleton_blocker/example/Skeleton_blocker_link.cpp | |
parent | dae83f0907a5bd94cb483ad0f54755da2d49fb75 (diff) | |
parent | 2f46606b406aafc69e37a68dca33e1858ab7b817 (diff) |
merged master
Diffstat (limited to 'src/Skeleton_blocker/example/Skeleton_blocker_link.cpp')
-rw-r--r-- | src/Skeleton_blocker/example/Skeleton_blocker_link.cpp | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp b/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp index e634b656..ba7ce43c 100644 --- a/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp +++ b/src/Skeleton_blocker/example/Skeleton_blocker_link.cpp @@ -32,25 +32,25 @@ int main(int argc, char *argv[]) { Simplex tetrahedron(Vertex_handle(0), Vertex_handle(1), Vertex_handle(2), Vertex_handle(3)); complex.add_simplex(tetrahedron); - std::cout << "complex:" << complex.to_string() << std::endl; + std::clog << "complex:" << complex.to_string() << std::endl; // build the link of vertex 1, eg a triangle {0,2,3} auto link = complex.link(Vertex_handle(1)); - std::cout << "link:" << link.to_string() << std::endl; + std::clog << "link:" << link.to_string() << std::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) - std::cout << "link.contains_vertex(Vertex_handle(" << i << ")):" << link.contains_vertex(Vertex_handle(i)) << + std::clog << "link.contains_vertex(Vertex_handle(" << i << ")):" << link.contains_vertex(Vertex_handle(i)) << std::endl; - std::cout << std::endl; + std::clog << std::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) - std::cout << "link.contains_vertex(Root_vertex_handle(" << i << ")):" << + std::clog << "link.contains_vertex(Root_vertex_handle(" << i << ")):" << link.contains_vertex(Root_vertex_handle(i)) << std::endl; return EXIT_SUCCESS; |