adjacency lists can be directed, undirected or bidirectional for Simplex tree insert_graph method

Use of directed adjacency lists to fasten computation and use less memory


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

Former-commit-id: 839fabc15398ce590d09806bd783cd656029f3c1

1 files changed, 1 insertions, 1 deletions

diff --git a/src/Simplex_tree/example/cech_complex_cgal_mini_sphere_3d.cpp b/src/Simplex_tree/example/cech_complex_cgal_mini_sphere_3d.cpp
index 34092ef6..6bab8adb 100644
--- a/src/Simplex_tree/example/cech_complex_cgal_mini_sphere_3d.cpp
+++ b/src/Simplex_tree/example/cech_complex_cgal_mini_sphere_3d.cpp
@@ -50,7 +50,7 @@ using Vertex_handle = Simplex_tree::Vertex_handle;
 using Simplex_handle = Simplex_tree::Simplex_handle;
 using Filtration_value = Simplex_tree::Filtration_value;
 using Siblings = Simplex_tree::Siblings;
-using Graph_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS,
+using Graph_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS,
                                       boost::property<Gudhi::vertex_filtration_t, Filtration_value>,
                                       boost::property<Gudhi::edge_filtration_t, Filtration_value> >;
 using Edge_t = std::pair<Vertex_handle, Vertex_handle>;