diff options
| author | Gard Spreemann <gspr@nonempty.org> | 2020-08-11 13:55:57 +0200 |
|---|---|---|
| committer | Gard Spreemann <gspr@nonempty.org> | 2020-08-11 13:55:57 +0200 |
| commit | 1c05c20d7cf92c96b5036620cc892cb956c96785 (patch) | |
| tree | 8ae9a9396ea2b97f617915b8730632917cf786ec /src/common/include/gudhi/graph_simplicial_complex.h | |
| parent | 9b3079646ee3f6a494b83e864b3e10b8a93597d0 (diff) | |
| parent | 92fe082aed387ef050d5077157daea9ee3a7c7f4 (diff) | |
Merge tag 'tags/gudhi-release-3.3.0' into dfsg/latest
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 |