Uses of Class
org.apache.lucene.util.hnsw.HnswGraph
Packages that use HnswGraph
Package
Description
HNSW vector helper classes.
Lucene 9.9 file format.
Navigable Small-World graph, nominally Hierarchical but currently only has a single layer.
-
Uses of HnswGraph in org.apache.lucene.codecs.hnsw
Methods in org.apache.lucene.codecs.hnsw that return HnswGraph -
Uses of HnswGraph in org.apache.lucene.codecs.lucene99
Methods in org.apache.lucene.codecs.lucene99 that return HnswGraph -
Uses of HnswGraph in org.apache.lucene.util.hnsw
Subclasses of HnswGraph in org.apache.lucene.util.hnswModifier and TypeClassDescriptionfinal classAnHnswGraphwhere all nodes and connections are held in memory.Fields in org.apache.lucene.util.hnsw declared as HnswGraphMethods in org.apache.lucene.util.hnsw with parameters of type HnswGraphModifier and TypeMethodDescriptionUpdateGraphsUtils.computeJoinSet(HnswGraph graph) Find nodes in the graph that best cover the graph.static FilteredHnswGraphSearcherCreates a new filtered graph searcher.static InitializedHnswGraphBuilderInitializedHnswGraphBuilder.fromGraph(RandomVectorScorerSupplier scorerSupplier, int M, int beamWidth, long seed, HnswGraph initializerGraph, int[] newOrdMap, BitSet initializedNodes, int totalNumberOfVectors) Create a new HnswGraphBuilder that is initialized with the provided HnswGraph.static MergingHnswGraphBuilderMergingHnswGraphBuilder.fromGraphs(RandomVectorScorerSupplier scorerSupplier, int M, int beamWidth, long seed, HnswGraph[] graphs, int[][] ordMaps, int totalNumberOfVectors, BitSet initializedNodes) Create a new HnswGraphBuilder that is initialized with the provided HnswGraph.static OnHeapHnswGraphInitializedHnswGraphBuilder.initGraph(int M, HnswGraph initializerGraph, int[] newOrdMap, int totalNumberOfVectors) static voidHnswGraphSearcher.search(RandomVectorScorer scorer, KnnCollector knnCollector, HnswGraph graph, Bits acceptOrds) static voidHnswGraphSearcher.search(RandomVectorScorer scorer, KnnCollector knnCollector, HnswGraph graph, Bits acceptOrds, int filteredDocCount) Searches the HNSW graph for the nearest neighbors of a query vector.HnswGraphSearcher.searchLevel(RandomVectorScorer scorer, int topK, int level, int[] eps, HnswGraph graph) Searches for the nearest neighbors of a query vector in a given level.