summaryrefslogtreecommitdiff
path: root/src/common/include/gudhi
diff options
context:
space:
mode:
authorvrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2019-01-22 08:55:53 +0000
committervrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2019-01-22 08:55:53 +0000
commite2487023711a163b51e403330fa6efb982badd59 (patch)
tree6056d4ae61c1289a4f348cced82c5994ae5d205b /src/common/include/gudhi
parente105da964b96218459c8822816de36273f6cdf17 (diff)
parent453fc857c70a5168eed639545faa903f48e84c9c (diff)
Merge of adjacency_list_direction_improvement branch.
Test and benchmark of directed, undirected and bidirectionnal adjacency list. Use of directed when possible as it is the more efficient. git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@4069 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 1ab5c9e741ea57d734e3ee34f207c6790b132a48
Diffstat (limited to 'src/common/include/gudhi')
-rw-r--r--src/common/include/gudhi/graph_simplicial_complex.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/common/include/gudhi/graph_simplicial_complex.h b/src/common/include/gudhi/graph_simplicial_complex.h
index 49fe56cc..0d81ca71 100644
--- a/src/common/include/gudhi/graph_simplicial_complex.h
+++ b/src/common/include/gudhi/graph_simplicial_complex.h
@@ -49,7 +49,7 @@ struct vertex_filtration_t {
*
*/
template <typename SimplicialComplexForProximityGraph>
-using Proximity_graph = typename boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS
+using Proximity_graph = typename boost::adjacency_list < boost::vecS, boost::vecS, boost::directedS
, boost::property < vertex_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value >
, boost::property < edge_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value >>;