hnsw-lite
Version:
A lightweight HNSW implementation for nearest neighbor search.
12 lines (11 loc) • 343 B
TypeScript
export declare class Node {
id: string;
vector: number[];
neighbors: [Node, number][];
maxEdges: number;
layer: number;
constructor(id: string, vector: number[], maxEdges: number, layer: number);
addNeighbor(node: Node, distance: number): void;
removeNeighbor(target: Node): void;
clearNeighbors(): void;
}