DOC Remove graph_shortest_path references (scikit-learn#20677)

jjerphan · web-flow · commit 20ee33a95acf · 2021-08-04T16:40:16.000+02:00
diff --git a/doc/developers/utilities.rst b/doc/developers/utilities.rst
@@ -165,13 +165,6 @@ Graph Routines
   If this is ever needed again, it would be far faster to use a single
   iteration of Dijkstra's algorithm from ``graph_shortest_path``.
 
-- :func:`graph_shortest_path.graph_shortest_path`:
-  (used in :class:`~sklearn.manifold.Isomap`)
-  Return the shortest path between all pairs of connected points on a directed
-  or undirected graph.  Both the Floyd-Warshall algorithm and Dijkstra's
-  algorithm are available.  The algorithm is most efficient when the
-  connectivity matrix is a ``scipy.sparse.csr_matrix``.
-
 
 Testing Functions
 =================
diff --git a/doc/modules/classes.rst b/doc/modules/classes.rst
@@ -1602,7 +1602,6 @@ Plotting
    utils.gen_batches
    utils.gen_even_slices
    utils.graph.single_source_shortest_path_length
-   utils.graph_shortest_path.graph_shortest_path
    utils.indexable
    utils.metaestimators.if_delegate_has_method
    utils.metaestimators.available_if
