diff options
author | Vincent Rouvreau <10407034+VincentRouvreau@users.noreply.github.com> | 2020-07-02 12:25:08 -0700 |
---|---|---|
committer | GitHub <noreply@github.com> | 2020-07-02 12:25:08 -0700 |
commit | 444ec77fe16783c35ef86598011a662c5d6e8d92 (patch) | |
tree | 5020b95c18d0206fe8e693a40d1e4aaf132d6a51 /src/common/include/gudhi/graph_simplicial_complex.h | |
parent | 3c7a4d01ec758d68a219fae8981c9847cf8d7a0f (diff) | |
parent | e44b0a88e2241f81b51b9060f73ac86f53c9cfc1 (diff) |
Merge pull request #281 from VincentRouvreau/edge_collapse_integration_vincent
Edge collapse integration vincent
Diffstat (limited to 'src/common/include/gudhi/graph_simplicial_complex.h')
-rw-r--r-- | src/common/include/gudhi/graph_simplicial_complex.h | 5 |
1 files changed, 5 insertions, 0 deletions
diff --git a/src/common/include/gudhi/graph_simplicial_complex.h b/src/common/include/gudhi/graph_simplicial_complex.h index b8508697..da9dee7d 100644 --- a/src/common/include/gudhi/graph_simplicial_complex.h +++ b/src/common/include/gudhi/graph_simplicial_complex.h @@ -19,6 +19,9 @@ #include <tuple> // for std::tie namespace Gudhi { +/** @file + * @brief Graph simplicial complex methods + */ /* Edge tag for Boost PropertyGraph. */ struct edge_filtration_t { @@ -46,6 +49,8 @@ using Proximity_graph = typename boost::adjacency_list < boost::vecS, boost::vec * If points contains n elements, the proximity graph is the graph with n vertices, and an edge [u,v] iff the * distance function between points u and v is smaller than threshold. * + * \tparam SimplicialComplexForProximityGraph furnishes `Filtration_value` and `Vertex_handle` type definitions. + * * \tparam ForwardPointRange furnishes `.begin()` and `.end()` methods. * * \tparam Distance furnishes `operator()(const Point& p1, const Point& p2)`, where |