File tree Expand file tree Collapse file tree 1 file changed +8
-8
lines changed Expand file tree Collapse file tree 1 file changed +8
-8
lines changed Original file line number Diff line number Diff line change @@ -122,12 +122,12 @@ def gromov_hausdorff(
122
122
123
123
Parameters
124
124
-----------
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
127
127
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
131
131
Parameter that regulates the number of mappings to sample when
132
132
tightening upper bound of the mGH distance.
133
133
@@ -184,12 +184,12 @@ def make_distance_matrix_from_adjacency_matrix(AG):
184
184
185
185
Parameters
186
186
-----------
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 .
189
189
190
190
Returns
191
191
--------
192
- DG: np.array (|V(G)|×|V(G)|)
192
+ DG: (N,N) np.array
193
193
(Dense) distance matrix of the compact metric space
194
194
representation of G based on its shortest path lengths.
195
195
"""
You can’t perform that action at this time.
0 commit comments