perf(vector): Add heap to neighbour edges

[harshil-goel]

We now store the list of neighbours in a sorted distance from the starting node. This improves the accuracy and the time of the vector.
We are also using findStaticValue() function to get data faster.

Benchmarks:

1. Dataset 1 : 10k vector 100 dimension
   a. Time to ingest : 6 seconds
   b. Query time: 900us
   c. Accuracy: 97.9%

2. Dataset 2: 1million vectors 1280 dimension
   a. Time to ingest: 7 mins
   b. Query time (without cache): 35 ms
   c. Query time (with cache): 5 ms

[CLAassistant]

Thank you for your submission! We really appreciate it. Like many open source projects, we ask that you all sign our Contributor License Agreement before we can accept your contribution.
1 out of 2 committers have signed the CLA.

✅ harshil-goel
❌ Harshil goel

---

Harshil goel seems not to be a GitHub user. You need a GitHub account to be able to sign the CLA. If you have already a GitHub account, please add the email address used for this commit to your account.
_{You have signed the CLA already but the status is still pending? Let us recheck it.}

[CLAassistant]

Thank you for your submission! We really appreciate it. Like many open source projects, we ask that you all sign our Contributor License Agreement before we can accept your contribution.
1 out of 2 committers have signed the CLA.

✅ harshil-goel
❌ Harshil goel

---

Harshil goel seems not to be a GitHub user. You need a GitHub account to be able to sign the CLA. If you have already a GitHub account, please add the email address used for this commit to your account.
_{You have signed the CLA already but the status is still pending? Let us recheck it.}