message: Doc review: remove also this \fn
diff: @@ -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<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.
  