diff options
author | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2019-01-17 15:26:17 +0000 |
---|---|---|
committer | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2019-01-17 15:26:17 +0000 |
commit | 13b6be9e73f4ac5105f8344dcf37a7007e9ef904 (patch) | |
tree | 37adb80b55c51c4fea763676973e78ab3d6b104e /src/Rips_complex/include/gudhi/Sparse_rips_complex.h | |
parent | a9664a6796501af974eb18d924f28dd9ed6ddeb4 (diff) |
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
Diffstat (limited to 'src/Rips_complex/include/gudhi/Sparse_rips_complex.h')
-rw-r--r-- | src/Rips_complex/include/gudhi/Sparse_rips_complex.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h index 4dcc08ed..00da148f 100644 --- a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h +++ b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h @@ -55,7 +55,7 @@ template <typename Filtration_value> class Sparse_rips_complex { private: // TODO(MG): use a different graph where we know we can safely insert in parallel. - typedef typename boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, + typedef typename boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<vertex_filtration_t, Filtration_value>, boost::property<edge_filtration_t, Filtration_value>> Graph; |