Corner case when entry point has duplicates

A potential issue arises when the entry point node contains a number of duplicate vectors (vectors with the same values) that are equal to or greater than the max_degree. In this scenario, the graph traversal remains stuck at the entry point because all the nearest neighbors are these duplicates, leading to a recall drop to zero