hnsw-lite
Version:
A lightweight HNSW implementation for nearest neighbor search.
14 lines (13 loc) • 462 B
TypeScript
import { Node } from './node';
export declare class Layer {
nodes: Node[];
nodeMap: Map<string, Node>;
maxEdges: number;
layer: number;
constructor(maxEdges: number, layer: number);
addNode(vector: number[], id: string, layer: number): Node;
private connectNearestNeighbors;
removeNode(nodeId: string): void;
searchLayer(startNodeId: string | null, queryVector: number[], nClosest?: number): string[];
toJSON(): object;
}