Package io.github.jbellis.jvector.graph
package io.github.jbellis.jvector.graph
-
ClassDescriptionThis is NOT a general "make vectors go faster" class.A concurrent set of neighbors that encapsulates diversity/pruning mechanics.Represents a graph-based vector index.A View that knows how to compute scores against a query vector.Encapsulates the state of a graph for searching.Builder for Concurrent GraphIndex.Searches a graph to find nearest neighbors to a query vector.Deprecated.A List-backed implementation of the
RandomAccessVectorValuesinterface.RandomAccessValues backed by a Map.NodeArray encodes nodeids and their scores relative to some other element (a query vector, or another graph node) as a pair of growable arrays.NodeQueue uses aAbstractLongHeapto store lists of nodes in a graph, represented as a node id with an associated score packed together as a sortable long, which is sorted primarily by score.Iterator over graph nodes that includes the size –- the total number of nodes to be iterated over.NodesUnsorted contains scored node ids in insertion order.AnGraphIndexthat offers concurrent access; for typical graphs you will get significant speedups in construction and searching as you add threads.Provides random access to vectors by dense ordinal.Container class for results of an ANN search, along with associated metrics about the behavior of the search.