Package io.github.jbellis.jvector.graph

package io.github.jbellis.jvector.graph

Class	Description
ConcurrentNeighborSet	A concurrent set of neighbors that encapsulates diversity/pruning mechanics.
GraphIndex<T>	Represents a graph-based vector index.
GraphIndex.View<T>
GraphIndexBuilder<T>	Builder for Concurrent GraphIndex.
GraphSearcher<T>	Searches a graph to find nearest neighbors to a query vector.
GraphSearcher.Builder<T>	Builder
ListRandomAccessVectorValues	A List-backed implementation of the RandomAccessVectorValues interface.
NeighborArray	NeighborArray encodes the neighbors of a node and their mutual scores in the graph as a pair of growable arrays.
NeighborQueue	NeighborQueue uses a LongHeap to store lists of arcs in a graph, represented as a neighbor node id with an associated score packed together as a sortable long, which is sorted primarily by score.
NeighborSimilarity	Encapsulates comparing node distances.
NeighborSimilarity.ApproximateScoreFunction
NeighborSimilarity.ExactScoreFunction
NeighborSimilarity.ReRanker<T>
NeighborSimilarity.ScoreFunction	Provides an API for encapsulating similarity to another node or vector.
NodesIterator	Iterator over the graph nodes on a certain level that includes the size – the total number of nodes to be iterated over.
NodesIterator.ArrayNodesIterator
OnHeapGraphIndex<T>	An GraphIndex that offers concurrent access; for typical graphs you will get significant speedups in construction and searching as you add threads.
RandomAccessVectorValues<T>	Provides random access to vectors by dense ordinal.
SearchResult	Container class for results of an ANN search, along with associated metrics about the behavior of the search.
SearchResult.NodeScore