From 02c572551679589c87106cedd72f419938f85024 Mon Sep 17 00:00:00 2001 From: ROUVREAU Vincent Date: Wed, 1 Jul 2020 22:16:20 +0200 Subject: Doc review: remove also this \fn --- src/common/include/gudhi/graph_simplicial_complex.h | 3 --- 1 file changed, 3 deletions(-) (limited to 'src/common/include') 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 @@ -45,9 +45,6 @@ using Proximity_graph = typename boost::adjacency_list < boost::vecS, boost::vec , boost::property < edge_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value >>; /** \brief Computes the proximity graph of the points. - * - * \fn Gudhi::Proximity_graph 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. -- cgit v1.2.3