diff options
| author | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2020-07-01 22:16:20 +0200 |
|---|---|---|
| committer | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2020-07-01 22:16:20 +0200 |
| commit | 02c572551679589c87106cedd72f419938f85024 (patch) | |
| tree | 4b407453e919183123efdc48a4ceed96e006602e /src | |
| parent | f7876ea08e810c57f90e0233fffbd91d57f6d037 (diff) | |
Doc review: remove also this \fn
Diffstat (limited to 'src')
| -rw-r--r-- | src/common/include/gudhi/graph_simplicial_complex.h | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/src/common/include/gudhi/graph_simplicial_complex.h b/src/common/include/gudhi/graph_simplicial_complex.h index 3e7720d7..da9dee7d 100644 --- a/src/common/include/gudhi/graph_simplicial_complex.h +++ b/src/common/include/gudhi/graph_simplicial_complex.h @@ -46,9 +46,6 @@ using Proximity_graph = typename boost::adjacency_list < boost::vecS, boost::vec /** \brief Computes the proximity graph of the points. * - * \fn Gudhi::Proximity_graph<SimplicialComplexForProximityGraph> compute_proximity_graph(const ForwardPointRange& - * points, typename SimplicialComplexForProximityGraph::Filtration_value threshold, Distance distance) - * * 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. * |