Open
Description
Describe the bug
The DBSCAN algorithm in its current form has some flags that determine the algorithm that is used in the calculation of the vertex degree and adjacency matrix. Currently, both steps have only one algorithm.
The code should be cut down quite a bit more:
- The vertex degree step has two mostly similar algorithms for precomputed and other metrics. This could (should?) be unified;
- The adj_graph step now has a single algorithm and a separate runner file that is redundant.
Additional context
PR #4804 removes the naive versions of the algorithms. Code review: #4804 (comment)
Activity