UNPKG

hnsw-lite

Version:

A lightweight HNSW implementation for nearest neighbor search.

7 lines 217 B
export const calculateEuclideanDistance = (v1: number[], v2: number[]): number =>{ let sum = 0; for (let i = 0; i < v1.length; i++) { sum += Math.pow(v1[i] - v2[i], 2); } return Math.sqrt(sum); }