causantic 0.2.0

package/dist/clusters/hdbscan/incremental.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Incremental point assignment for HDBSCAN.
+ * Assigns new points to existing clusters without reclustering.
+ */
+import type { HDBSCANModel } from './types.js';
+/**
+ * Assign new points to existing clusters.
+ *
+ * For each new point:
+ * 1. Find its k nearest neighbors in the original dataset
+ * 2. Compute its core distance
+ * 3. Find mutual reachability to cluster centroids
+ * 4. Assign to closest cluster within threshold, or -1 (noise)
+ *
+ * @param newPoints New points to assign.
+ * @param model Fitted HDBSCAN model.
+ * @param k k value for core distance (typically minSamples).
+ * @param metric Distance metric.
+ * @returns Labels for new points.
+ */
+export declare function predictLabels(newPoints: number[][], model: HDBSCANModel, k: number, metric?: 'euclidean' | 'angular'): number[];
+/**
+ * Compute centroid from points.
+ */
+export declare function computeCentroid(points: number[][]): number[];
+/**
+ * Select exemplar points (closest to centroid).
+ */
+export declare function selectExemplars(pointIndices: number[], points: number[][], centroid: number[], numExemplars?: number, metric?: 'euclidean' | 'angular'): number[];
+//# sourceMappingURL=incremental.d.ts.map

package/dist/clusters/hdbscan/incremental.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"incremental.d.ts","sourceRoot":"","sources":["../../../src/clusters/hdbscan/incremental.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG/C;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,EAAE,EAAE,EACrB,KAAK,EAAE,YAAY,EACnB,CAAC,EAAE,MAAM,EACT,MAAM,GAAE,WAAW,GAAG,SAAuB,GAC5C,MAAM,EAAE,CAkEV;AA2BD;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CA6B5D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAC7B,YAAY,EAAE,MAAM,EAAE,EACtB,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,QAAQ,EAAE,MAAM,EAAE,EAClB,YAAY,GAAE,MAAU,EACxB,MAAM,GAAE,WAAW,GAAG,SAAuB,GAC5C,MAAM,EAAE,CAWV"}

package/dist/clusters/hdbscan/incremental.js

@@ -0,0 +1,130 @@
+/**
+ * Incremental point assignment for HDBSCAN.
+ * Assigns new points to existing clusters without reclustering.
+ */
+import { euclideanDistance, angularDistance } from './kd-tree.js';
+import { quickselect } from '../../utils/array-utils.js';
+/**
+ * Assign new points to existing clusters.
+ *
+ * For each new point:
+ * 1. Find its k nearest neighbors in the original dataset
+ * 2. Compute its core distance
+ * 3. Find mutual reachability to cluster centroids
+ * 4. Assign to closest cluster within threshold, or -1 (noise)
+ *
+ * @param newPoints New points to assign.
+ * @param model Fitted HDBSCAN model.
+ * @param k k value for core distance (typically minSamples).
+ * @param metric Distance metric.
+ * @returns Labels for new points.
+ */
+export function predictLabels(newPoints, model, k, metric = 'euclidean') {
+    const distFn = metric === 'euclidean' ? euclideanDistance : angularDistance;
+    const labels = new Array(newPoints.length).fill(-1);
+    if (model.centroids.size === 0) {
+        return labels;
+    }
+    for (let i = 0; i < newPoints.length; i++) {
+        const point = newPoints[i];
+        // Compute core distance for new point
+        const coreDistance = computeNewPointCoreDistance(point, model.embeddings, k, distFn);
+        // Find closest cluster
+        let bestLabel = -1;
+        let bestDistance = Infinity;
+        for (const [clusterLabel, centroid] of model.centroids) {
+            // Get exemplar points for this cluster
+            const exemplarIndices = model.exemplars.get(clusterLabel) ?? [];
+            // Compute mutual reachability to exemplars
+            let minMRD = Infinity;
+            for (const exIdx of exemplarIndices) {
+                const exCoreDistance = model.coreDistances[exIdx];
+                const rawDist = distFn(point, model.embeddings[exIdx]);
+                const mrd = Math.max(coreDistance, exCoreDistance, rawDist);
+                minMRD = Math.min(minMRD, mrd);
+            }
+            // Also check distance to centroid
+            const centroidDist = distFn(point, centroid);
+            // Use minimum of MRD to exemplars and raw distance to centroid
+            const effectiveDistance = Math.min(minMRD, centroidDist);
+            if (effectiveDistance < bestDistance) {
+                bestDistance = effectiveDistance;
+                bestLabel = clusterLabel;
+            }
+        }
+        // Assign if within reasonable threshold
+        // Use the cluster's max lambda as a threshold guide
+        if (bestLabel !== -1) {
+            const maxLambda = model.clusterMaxLambda.get(bestLabel);
+            if (maxLambda && maxLambda > 0) {
+                const threshold = 1 / maxLambda;
+                if (bestDistance <= threshold * 2) {
+                    // Allow some slack for new points
+                    labels[i] = bestLabel;
+                }
+            }
+            else {
+                // No lambda info, use distance-based heuristic
+                labels[i] = bestLabel;
+            }
+        }
+    }
+    return labels;
+}
+/**
+ * Compute core distance for a new point.
+ */
+function computeNewPointCoreDistance(point, existingPoints, k, distFn) {
+    if (existingPoints.length === 0) {
+        return 0;
+    }
+    const effectiveK = Math.min(k, existingPoints.length);
+    if (effectiveK <= 0) {
+        return 0;
+    }
+    // Compute distances to all existing points
+    const distances = existingPoints.map((p) => distFn(point, p));
+    // Quickselect to find k-th smallest
+    return quickselect(distances, effectiveK - 1);
+}
+/**
+ * Compute centroid from points.
+ */
+export function computeCentroid(points) {
+    if (points.length === 0) {
+        return [];
+    }
+    const dim = points[0].length;
+    const sum = new Array(dim).fill(0);
+    for (const p of points) {
+        for (let i = 0; i < dim; i++) {
+            sum[i] += p[i];
+        }
+    }
+    // Normalize
+    let norm = 0;
+    for (let i = 0; i < dim; i++) {
+        sum[i] /= points.length;
+        norm += sum[i] * sum[i];
+    }
+    norm = Math.sqrt(norm);
+    if (norm > 0) {
+        for (let i = 0; i < dim; i++) {
+            sum[i] /= norm;
+        }
+    }
+    return sum;
+}
+/**
+ * Select exemplar points (closest to centroid).
+ */
+export function selectExemplars(pointIndices, points, centroid, numExemplars = 3, metric = 'euclidean') {
+    const distFn = metric === 'euclidean' ? euclideanDistance : angularDistance;
+    const withDistances = pointIndices.map((idx) => ({
+        index: idx,
+        distance: distFn(points[idx], centroid),
+    }));
+    withDistances.sort((a, b) => a.distance - b.distance);
+    return withDistances.slice(0, numExemplars).map((w) => w.index);
+}
+//# sourceMappingURL=incremental.js.map

package/dist/clusters/hdbscan/incremental.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"incremental.js","sourceRoot":"","sources":["../../../src/clusters/hdbscan/incremental.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAElE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAEzD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAqB,EACrB,KAAmB,EACnB,CAAS,EACT,SAAkC,WAAW;IAE7C,MAAM,MAAM,GAAG,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;IAC5E,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5D,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAE3B,sCAAsC;QACtC,MAAM,YAAY,GAAG,2BAA2B,CAC9C,KAAK,EACL,KAAK,CAAC,UAAU,EAChB,CAAC,EACD,MAAM,CACP,CAAC;QAEF,uBAAuB;QACvB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,QAAQ,CAAC;QAE5B,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACvD,uCAAuC;YACvC,MAAM,eAAe,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAEhE,2CAA2C;YAC3C,IAAI,MAAM,GAAG,QAAQ,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;gBACpC,MAAM,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;gBACvD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC;gBAC5D,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACjC,CAAC;YAED,kCAAkC;YAClC,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAE7C,+DAA+D;YAC/D,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAEzD,IAAI,iBAAiB,GAAG,YAAY,EAAE,CAAC;gBACrC,YAAY,GAAG,iBAAiB,CAAC;gBACjC,SAAS,GAAG,YAAY,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,oDAAoD;QACpD,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;YACrB,MAAM,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACxD,IAAI,SAAS,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;gBAChC,IAAI,YAAY,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAClC,kCAAkC;oBAClC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBACxB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,+CAA+C;gBAC/C,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,2BAA2B,CAClC,KAAe,EACf,cAA0B,EAC1B,CAAS,EACT,MAA4C;IAE5C,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,2CAA2C;IAC3C,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAE9D,oCAAoC;IACpC,OAAO,WAAW,CAAC,SAAS,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAkB;IAChD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,YAAY;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,YAAsB,EACtB,MAAkB,EAClB,QAAkB,EAClB,eAAuB,CAAC,EACxB,SAAkC,WAAW;IAE7C,MAAM,MAAM,GAAG,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;IAE5E,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC/C,KAAK,EAAE,GAAG;QACV,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;KACxC,CAAC,CAAC,CAAC;IAEJ,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAEtD,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC"}

package/dist/clusters/hdbscan/kd-tree.d.ts

@@ -0,0 +1,51 @@
+/**
+ * KD-tree for approximate k-nearest neighbor search.
+ * Performance degrades in high dimensions but still provides speedup for k-NN.
+ */
+interface NearestNeighbor {
+    index: number;
+    distance: number;
+}
+/**
+ * KD-tree for efficient k-nearest neighbor search.
+ * In high dimensions (>30), performance degrades but still faster than brute force.
+ */
+export declare class KDTree {
+    private root;
+    private dimensions;
+    /**
+     * Build a KD-tree from points.
+     * @param points Array of points (each point is a number array).
+     */
+    constructor(points: number[][]);
+    /**
+     * Build tree recursively.
+     */
+    private buildTree;
+    /**
+     * Find k nearest neighbors to a query point.
+     * @param query Query point.
+     * @param k Number of neighbors to find.
+     * @param excludeIndex Optional index to exclude (for self-queries).
+     */
+    kNearest(query: number[], k: number, excludeIndex?: number): NearestNeighbor[];
+    /**
+     * Find the nearest neighbor to a query point.
+     */
+    nearest(query: number[], excludeIndex?: number): NearestNeighbor | null;
+    /**
+     * Compute Euclidean distance between two points.
+     */
+    private euclideanDistance;
+}
+/**
+ * Compute Euclidean distance between two points.
+ */
+export declare function euclideanDistance(a: number[], b: number[]): number;
+/**
+ * Compute angular distance between two normalized vectors.
+ * Angular distance = 1 - cos(angle) = 1 - dot(a, b)
+ */
+export declare function angularDistance(a: number[], b: number[]): number;
+export {};
+//# sourceMappingURL=kd-tree.d.ts.map

package/dist/clusters/hdbscan/kd-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kd-tree.d.ts","sourceRoot":"","sources":["../../../src/clusters/hdbscan/kd-tree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH,UAAU,eAAe;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;GAGG;AACH,qBAAa,MAAM;IACjB,OAAO,CAAC,IAAI,CAAuB;IACnC,OAAO,CAAC,UAAU,CAAa;IAE/B;;;OAGG;gBACS,MAAM,EAAE,MAAM,EAAE,EAAE;IAU9B;;OAEG;IACH,OAAO,CAAC,SAAS;IAyBjB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,eAAe,EAAE;IA+C9E;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,eAAe,GAAG,IAAI;IAKvE;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAQ1B;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAOlE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAMhE"}

package/dist/clusters/hdbscan/kd-tree.js

@@ -0,0 +1,130 @@
+/**
+ * KD-tree for approximate k-nearest neighbor search.
+ * Performance degrades in high dimensions but still provides speedup for k-NN.
+ */
+/**
+ * KD-tree for efficient k-nearest neighbor search.
+ * In high dimensions (>30), performance degrades but still faster than brute force.
+ */
+export class KDTree {
+    root = null;
+    dimensions = 0;
+    /**
+     * Build a KD-tree from points.
+     * @param points Array of points (each point is a number array).
+     */
+    constructor(points) {
+        if (points.length === 0) {
+            return;
+        }
+        this.dimensions = points[0].length;
+        const indexedPoints = points.map((p, i) => ({ point: p, index: i }));
+        this.root = this.buildTree(indexedPoints, 0);
+    }
+    /**
+     * Build tree recursively.
+     */
+    buildTree(points, depth) {
+        if (points.length === 0) {
+            return null;
+        }
+        const dim = depth % this.dimensions;
+        // Sort by splitting dimension
+        points.sort((a, b) => a.point[dim] - b.point[dim]);
+        const mid = Math.floor(points.length / 2);
+        const node = {
+            point: points[mid].point,
+            index: points[mid].index,
+            splitDim: dim,
+            left: this.buildTree(points.slice(0, mid), depth + 1),
+            right: this.buildTree(points.slice(mid + 1), depth + 1),
+        };
+        return node;
+    }
+    /**
+     * Find k nearest neighbors to a query point.
+     * @param query Query point.
+     * @param k Number of neighbors to find.
+     * @param excludeIndex Optional index to exclude (for self-queries).
+     */
+    kNearest(query, k, excludeIndex) {
+        const neighbors = [];
+        let maxDist = Infinity;
+        const search = (node) => {
+            if (node === null) {
+                return;
+            }
+            // Compute distance to this node
+            if (node.index !== excludeIndex) {
+                const dist = this.euclideanDistance(query, node.point);
+                if (neighbors.length < k) {
+                    neighbors.push({ index: node.index, distance: dist });
+                    neighbors.sort((a, b) => b.distance - a.distance); // Max at front
+                    if (neighbors.length === k) {
+                        maxDist = neighbors[0].distance;
+                    }
+                }
+                else if (dist < maxDist) {
+                    neighbors[0] = { index: node.index, distance: dist };
+                    neighbors.sort((a, b) => b.distance - a.distance);
+                    maxDist = neighbors[0].distance;
+                }
+            }
+            // Determine which side to search first
+            const dim = node.splitDim;
+            const diff = query[dim] - node.point[dim];
+            const first = diff < 0 ? node.left : node.right;
+            const second = diff < 0 ? node.right : node.left;
+            // Search the closer side first
+            search(first);
+            // Only search the other side if it could contain closer points
+            if (neighbors.length < k || Math.abs(diff) < maxDist) {
+                search(second);
+            }
+        };
+        search(this.root);
+        // Return in ascending distance order
+        return neighbors.reverse();
+    }
+    /**
+     * Find the nearest neighbor to a query point.
+     */
+    nearest(query, excludeIndex) {
+        const neighbors = this.kNearest(query, 1, excludeIndex);
+        return neighbors.length > 0 ? neighbors[0] : null;
+    }
+    /**
+     * Compute Euclidean distance between two points.
+     */
+    euclideanDistance(a, b) {
+        let sum = 0;
+        for (let i = 0; i < a.length; i++) {
+            const diff = a[i] - b[i];
+            sum += diff * diff;
+        }
+        return Math.sqrt(sum);
+    }
+}
+/**
+ * Compute Euclidean distance between two points.
+ */
+export function euclideanDistance(a, b) {
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        const diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    return Math.sqrt(sum);
+}
+/**
+ * Compute angular distance between two normalized vectors.
+ * Angular distance = 1 - cos(angle) = 1 - dot(a, b)
+ */
+export function angularDistance(a, b) {
+    let dot = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+    }
+    return 1 - dot;
+}
+//# sourceMappingURL=kd-tree.js.map

package/dist/clusters/hdbscan/kd-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kd-tree.js","sourceRoot":"","sources":["../../../src/clusters/hdbscan/kd-tree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAeH;;;GAGG;AACH,MAAM,OAAO,MAAM;IACT,IAAI,GAAkB,IAAI,CAAC;IAC3B,UAAU,GAAW,CAAC,CAAC;IAE/B;;;OAGG;IACH,YAAY,MAAkB;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACnC,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACK,SAAS,CACf,MAAiD,EACjD,KAAa;QAEb,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAEpC,8BAA8B;QAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAEnD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAW;YACnB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK;YACxB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK;YACxB,QAAQ,EAAE,GAAG;YACb,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;YACrD,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;SACxD,CAAC;QAEF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,KAAe,EAAE,CAAS,EAAE,YAAqB;QACxD,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,IAAI,OAAO,GAAG,QAAQ,CAAC;QAEvB,MAAM,MAAM,GAAG,CAAC,IAAmB,EAAQ,EAAE;YAC3C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,OAAO;YACT,CAAC;YAED,gCAAgC;YAChC,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBAEvD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;oBACtD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe;oBAClE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAC3B,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;oBAClC,CAAC;gBACH,CAAC;qBAAM,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBAC1B,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;oBACrD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;oBAClD,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAClC,CAAC;YACH,CAAC;YAED,uCAAuC;YACvC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAEjD,+BAA+B;YAC/B,MAAM,CAAC,KAAK,CAAC,CAAC;YAEd,+DAA+D;YAC/D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;gBACrD,MAAM,CAAC,MAAM,CAAC,CAAC;YACjB,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAElB,qCAAqC;QACrC,OAAO,SAAS,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAe,EAAE,YAAqB;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;QACxD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACpD,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAW,EAAE,CAAW;QAChD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAW,EAAE,CAAW;IACxD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,CAAW,EAAE,CAAW;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC;AACjB,CAAC"}

package/dist/clusters/hdbscan/min-heap.d.ts

@@ -0,0 +1,62 @@
+/**
+ * MinHeap (priority queue) for Prim's MST algorithm.
+ * Supports decreaseKey operation for efficient graph algorithms.
+ */
+export interface HeapEntry<T> {
+    key: number;
+    value: T;
+}
+/**
+ * Binary min-heap with decreaseKey support.
+ * Used for efficient minimum spanning tree construction.
+ */
+export declare class MinHeap<T> {
+    private heap;
+    private indexMap;
+    /**
+     * Number of elements in the heap.
+     */
+    get size(): number;
+    /**
+     * Whether the heap is empty.
+     */
+    isEmpty(): boolean;
+    /**
+     * Insert a new element.
+     */
+    insert(key: number, value: T): void;
+    /**
+     * Get the minimum element without removing it.
+     */
+    peek(): HeapEntry<T> | undefined;
+    /**
+     * Extract the minimum element.
+     */
+    extractMin(): HeapEntry<T> | undefined;
+    /**
+     * Decrease the key of an existing element.
+     * Returns true if the key was decreased, false if element not found.
+     */
+    decreaseKey(value: T, newKey: number): boolean;
+    /**
+     * Check if a value is in the heap.
+     */
+    has(value: T): boolean;
+    /**
+     * Get the current key for a value.
+     */
+    getKey(value: T): number | undefined;
+    /**
+     * Bubble up element at index to restore heap property.
+     */
+    private bubbleUp;
+    /**
+     * Bubble down element at index to restore heap property.
+     */
+    private bubbleDown;
+    /**
+     * Swap two elements and update index map.
+     */
+    private swap;
+}
+//# sourceMappingURL=min-heap.d.ts.map

package/dist/clusters/hdbscan/min-heap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-heap.d.ts","sourceRoot":"","sources":["../../../src/clusters/hdbscan/min-heap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,CAAC,CAAC;CACV;AAED;;;GAGG;AACH,qBAAa,OAAO,CAAC,CAAC;IACpB,OAAO,CAAC,IAAI,CAAsB;IAClC,OAAO,CAAC,QAAQ,CAA6B;IAE7C;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAQnC;;OAEG;IACH,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS;IAIhC;;OAEG;IACH,UAAU,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS;IAsBtC;;;OAGG;IACH,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAgB9C;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAItB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS;IAQpC;;OAEG;IACH,OAAO,CAAC,QAAQ;IAWhB;;OAEG;IACH,OAAO,CAAC,UAAU;IAwBlB;;OAEG;IACH,OAAO,CAAC,IAAI;CAOb"}

package/dist/clusters/hdbscan/min-heap.js

@@ -0,0 +1,139 @@
+/**
+ * MinHeap (priority queue) for Prim's MST algorithm.
+ * Supports decreaseKey operation for efficient graph algorithms.
+ */
+/**
+ * Binary min-heap with decreaseKey support.
+ * Used for efficient minimum spanning tree construction.
+ */
+export class MinHeap {
+    heap = [];
+    indexMap = new Map();
+    /**
+     * Number of elements in the heap.
+     */
+    get size() {
+        return this.heap.length;
+    }
+    /**
+     * Whether the heap is empty.
+     */
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    /**
+     * Insert a new element.
+     */
+    insert(key, value) {
+        const entry = { key, value };
+        this.heap.push(entry);
+        const index = this.heap.length - 1;
+        this.indexMap.set(value, index);
+        this.bubbleUp(index);
+    }
+    /**
+     * Get the minimum element without removing it.
+     */
+    peek() {
+        return this.heap[0];
+    }
+    /**
+     * Extract the minimum element.
+     */
+    extractMin() {
+        if (this.heap.length === 0) {
+            return undefined;
+        }
+        const min = this.heap[0];
+        this.indexMap.delete(min.value);
+        if (this.heap.length === 1) {
+            this.heap.pop();
+            return min;
+        }
+        // Move last element to root and bubble down
+        const last = this.heap.pop();
+        this.heap[0] = last;
+        this.indexMap.set(last.value, 0);
+        this.bubbleDown(0);
+        return min;
+    }
+    /**
+     * Decrease the key of an existing element.
+     * Returns true if the key was decreased, false if element not found.
+     */
+    decreaseKey(value, newKey) {
+        const index = this.indexMap.get(value);
+        if (index === undefined) {
+            return false;
+        }
+        if (newKey >= this.heap[index].key) {
+            // New key is not smaller, no change needed
+            return false;
+        }
+        this.heap[index].key = newKey;
+        this.bubbleUp(index);
+        return true;
+    }
+    /**
+     * Check if a value is in the heap.
+     */
+    has(value) {
+        return this.indexMap.has(value);
+    }
+    /**
+     * Get the current key for a value.
+     */
+    getKey(value) {
+        const index = this.indexMap.get(value);
+        if (index === undefined) {
+            return undefined;
+        }
+        return this.heap[index].key;
+    }
+    /**
+     * Bubble up element at index to restore heap property.
+     */
+    bubbleUp(index) {
+        while (index > 0) {
+            const parentIndex = Math.floor((index - 1) / 2);
+            if (this.heap[parentIndex].key <= this.heap[index].key) {
+                break;
+            }
+            this.swap(index, parentIndex);
+            index = parentIndex;
+        }
+    }
+    /**
+     * Bubble down element at index to restore heap property.
+     */
+    bubbleDown(index) {
+        const length = this.heap.length;
+        while (true) {
+            const leftChild = 2 * index + 1;
+            const rightChild = 2 * index + 2;
+            let smallest = index;
+            if (leftChild < length && this.heap[leftChild].key < this.heap[smallest].key) {
+                smallest = leftChild;
+            }
+            if (rightChild < length && this.heap[rightChild].key < this.heap[smallest].key) {
+                smallest = rightChild;
+            }
+            if (smallest === index) {
+                break;
+            }
+            this.swap(index, smallest);
+            index = smallest;
+        }
+    }
+    /**
+     * Swap two elements and update index map.
+     */
+    swap(i, j) {
+        const temp = this.heap[i];
+        this.heap[i] = this.heap[j];
+        this.heap[j] = temp;
+        this.indexMap.set(this.heap[i].value, i);
+        this.indexMap.set(this.heap[j].value, j);
+    }
+}
+//# sourceMappingURL=min-heap.js.map

package/dist/clusters/hdbscan/min-heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-heap.js","sourceRoot":"","sources":["../../../src/clusters/hdbscan/min-heap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH;;;GAGG;AACH,MAAM,OAAO,OAAO;IACV,IAAI,GAAmB,EAAE,CAAC;IAC1B,QAAQ,GAAmB,IAAI,GAAG,EAAE,CAAC;IAE7C;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAW,EAAE,KAAQ;QAC1B,MAAM,KAAK,GAAiB,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YAChB,OAAO,GAAG,CAAC;QACb,CAAC;QAED,4CAA4C;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAEnB,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,KAAQ,EAAE,MAAc;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;YACnC,2CAA2C;YAC3C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvD,MAAM;YACR,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YAC9B,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAa;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAEhC,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAChC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACjC,IAAI,QAAQ,GAAG,KAAK,CAAC;YAErB,IAAI,SAAS,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC7E,QAAQ,GAAG,SAAS,CAAC;YACvB,CAAC;YACD,IAAI,UAAU,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC/E,QAAQ,GAAG,UAAU,CAAC;YACxB,CAAC;YAED,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;gBACvB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC3B,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC;CACF"}

package/dist/clusters/hdbscan/mst.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Minimum Spanning Tree construction using Prim's algorithm.
+ * Uses mutual reachability distance for HDBSCAN.
+ */
+import type { MSTEdge } from './types.js';
+/**
+ * Build a minimum spanning tree using Prim's algorithm.
+ * Uses mutual reachability distance: MRD(a, b) = max(core(a), core(b), dist(a, b))
+ *
+ * @param points All points (embeddings).
+ * @param coreDistances Core distance for each point.
+ * @param metric Distance metric.
+ * @returns MST edges sorted by weight (ascending).
+ */
+export declare function buildMST(points: number[][], coreDistances: number[], metric?: 'euclidean' | 'angular'): MSTEdge[];
+/**
+ * Compute mutual reachability distance between two points.
+ */
+export declare function mutualReachabilityDistance(pointA: number[], pointB: number[], coreDistA: number, coreDistB: number, metric?: 'euclidean' | 'angular'): number;
+//# sourceMappingURL=mst.d.ts.map

package/dist/clusters/hdbscan/mst.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mst.d.ts","sourceRoot":"","sources":["../../../src/clusters/hdbscan/mst.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,aAAa,EAAE,MAAM,EAAE,EACvB,MAAM,GAAE,WAAW,GAAG,SAAuB,GAC5C,OAAO,EAAE,CA+DX;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,MAAM,EAAE,EAChB,MAAM,EAAE,MAAM,EAAE,EAChB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,MAAM,GAAE,WAAW,GAAG,SAAuB,GAC5C,MAAM,CAIR"}