Uses of Class
org.apache.lucene.util.hnsw.HnswGraph

Packages that use HnswGraph

Package	Description
org.apache.lucene.codecs.lucene95	Lucene 9.5 file format.
org.apache.lucene.util.hnsw	Navigable Small-World graph, nominally Hierarchical but currently only has a single layer.

Uses of HnswGraph in org.apache.lucene.codecs.lucene95

Methods in org.apache.lucene.codecs.lucene95 that return HnswGraph

Modifier and Type	Method	Description
HnswGraph	Lucene95HnswVectorsReader.getGraph(String field)	Get knn graph values; used for testing

Uses of HnswGraph in org.apache.lucene.util.hnsw

Subclasses of HnswGraph in org.apache.lucene.util.hnsw

Modifier and Type	Class	Description
class	OnHeapHnswGraph	An HnswGraph where all nodes and connections are held in memory.

Fields in org.apache.lucene.util.hnsw declared as HnswGraph

Modifier and Type	Field	Description
static HnswGraph	HnswGraph.EMPTY	Empty graph value

Methods in org.apache.lucene.util.hnsw with parameters of type HnswGraph

Modifier and Type	Method	Description
static <T> HnswGraphBuilder<T>	HnswGraphBuilder.create(RandomAccessVectorValues<T> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, int M, int beamWidth, long seed, HnswGraph initializerGraph, Map<Integer,Integer> oldToNewOrdinalMap)
static NeighborQueue	HnswGraphSearcher.search(byte[] query, int topK, RandomAccessVectorValues<byte[]> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, HnswGraph graph, Bits acceptOrds, int visitedLimit)	Searches HNSW graph for the nearest neighbors of a query vector.
static NeighborQueue	HnswGraphSearcher.search(float[] query, int topK, RandomAccessVectorValues<float[]> vectors, VectorEncoding vectorEncoding, VectorSimilarityFunction similarityFunction, HnswGraph graph, Bits acceptOrds, int visitedLimit)	Searches HNSW graph for the nearest neighbors of a query vector.
NeighborQueue	HnswGraphSearcher.searchLevel(T query, int topK, int level, int[] eps, RandomAccessVectorValues<T> vectors, HnswGraph graph)	Searches for the nearest neighbors of a query vector in a given level.