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.
2 parents 813636b + d01b9a5 commit e6e60f7Copy full SHA for e6e60f7
hdbscan/validity.py
@@ -175,6 +175,8 @@ def internal_minimum_spanning_tree(mr_distances):
175
176
vertices = np.arange(mr_distances.shape[0])[
177
np.bincount(min_span_tree.T[:2].flatten().astype(np.intp)) > 1]
178
+ if not len(vertices):
179
+ vertices = [0]
180
# A little "fancy" we select from the flattened array reshape back
181
# (Fortran format to get indexing right) and take the product to do an and
182
# then convert back to boolean type.
0 commit comments