Fix TestHnswByteVectorGraph.testSortedAndUnsortedIndicesReturnSameRes…

…ults (#13361)

Considering that the graphs of 2 indices are organized differently we need to explore a lot of candidates to ensure that both searchers find the same docs. Increasing beamWidth (number of nearest neighbor candidates to track while searching the graph for each newly inserted node) from 5 to 10 fixes the test.

lucene/core/src/test/org/apache/lucene/util/hnsw/HnswGraphTestCase.java

@@ -286,7 +286,7 @@ public void testSortedAndUnsortedIndicesReturnSameResults() throws IOException {
     AbstractMockVectorValues<T> vectors = vectorValues(nDoc, dim);
 
     int M = random().nextInt(10) + 5;
-    int beamWidth = random().nextInt(10) + 5;
+    int beamWidth = random().nextInt(10) + 10;
     VectorSimilarityFunction similarityFunction =
         RandomizedTest.randomFrom(VectorSimilarityFunction.values());
     long seed = random().nextLong();