Add universal methods

docs/source/api.rst

@@ -45,6 +45,9 @@ Random Circuit Functions
 Algorithm Functions
 -------------------
 
+Specific Graph Type Methods
+'''''''''''''''''''''''''''
+
 .. autosummary::
    :toctree: stubs
 
@@ -88,6 +91,27 @@ Algorithm Functions
    retworkx.digraph_find_cycle
    retworkx.digraph_union
 
+Universal Functions
+'''''''''''''''''''
+
+These functions are algorithm functions that wrap per graph object
+type functions in the algorithms API but can be run with a
+:class:`~retworkx.PyGraph`, :class:`~retworkx.PyDiGraph`, or
+:class:`~retworkx.PyDAG` object.
+
+.. autosummary::
+   :toctree: stubs
+
+   retworkx.distance_matrix
+   retworkx.floyd_warshall_numpy
+   retworkx.adjacency_matrix
+   retworkx.all_simple_paths
+   retworkx.astar_shortest_path
+   retworkx.dijkstra_shortest_paths
+   retworkx.dijkstra_shortest_path_lengths
+   retworkx.k_shortest_path_lengths
+   retworkx.dfs_edges
+
 Exceptions
 ----------
 

releasenotes/notes/add-universal-functions-1e54351f1f7afa4b.yaml

@@ -0,0 +1,16 @@
+---
+features:
+  - |
+    New universal functions that can take in a :class:`~retworkx.PyGraph` or
+    :class:`~retworkx.PyDiGraph` instead of being class specific have been to
+    the retworkx API. These new functions are:
+
+     * :func:`retworkx.distance_matrix`
+     * :func:`retworkx.floyd_warshall_numpy`
+     * :func:`retworkx.adjacency_matrix`
+     * :func:`retworkx.all_simple_paths`
+     * :func:`retworkx.astar_shortest_path`
+     * :func:`retworkx.dijkstra_shortest_paths`
+     * :func:`retworkx.dijkstra_shortest_path_lengths`
+     * :func:`retworkx.k_shortest_path_lengths`
+     * :func:`retworkx.dfs_edges`