Skip to content

Commit 849a688

Browse files
author
Francis Motta
committed
updated docstring in persim.gromov_hausdorff.gromov_hausdorff() to fix autodoc warning related to use of |V(G)|x|V(G)|
1 parent 327ec0e commit 849a688

File tree

1 file changed

+8
-8
lines changed

1 file changed

+8
-8
lines changed

persim/gromov_hausdorff.py

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -122,12 +122,12 @@ def gromov_hausdorff(
122122
123123
Parameters
124124
-----------
125-
AG: np.array (|V(G)|×|V(G)|)
126-
(Sparse) adjacency matrix of graph G, or an iterable of
125+
AG: (N,N) np.array
126+
(Sparse) adjacency matrix of graph G with N vertices, or an iterable of
127127
adjacency matrices if AH=None.
128-
AH: np.array (|V(H)|×|V(H)|)
129-
(Sparse) adjacency matrix of graph H, or None.
130-
mapping_sample_size_order: np.array (2)
128+
AH: (M,M) np.array
129+
(Sparse) adjacency matrix of graph H with M vertices, or None.
130+
mapping_sample_size_order: (2,) np.array
131131
Parameter that regulates the number of mappings to sample when
132132
tightening upper bound of the mGH distance.
133133
@@ -184,12 +184,12 @@ def make_distance_matrix_from_adjacency_matrix(AG):
184184
185185
Parameters
186186
-----------
187-
AG: np.array (|V(G)|×|V(G)|)
188-
(Sparse) adjacency matrix of simple unweighted graph G.
187+
AG: (N,N) np.array
188+
(Sparse) adjacency matrix of simple unweighted graph G with N vertices.
189189
190190
Returns
191191
--------
192-
DG: np.array (|V(G)|×|V(G)|)
192+
DG: (N,N) np.array
193193
(Dense) distance matrix of the compact metric space
194194
representation of G based on its shortest path lengths.
195195
"""

0 commit comments

Comments
 (0)