We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 45639a8 commit c1a05d7Copy full SHA for c1a05d7
hdbscan/validity.py
@@ -154,7 +154,7 @@ def internal_minimum_spanning_tree(mr_distances):
154
row[0] = candidates[0]
155
156
vertices = np.arange(mr_distances.shape[0])[
157
- np.bincount(min_span_tree.T[:2].flatten().astype(np.int64)) > 1]
+ np.bincount(min_span_tree.T[:2].flatten().astype(np.intp)) > 1]
158
# A little "fancy" we select from the flattened array reshape back
159
# (Fortran format to get indexing right) and take the product to do an and
160
# then convert back to boolean type.
0 commit comments