A B C D E G H I K M N O P R S T U V W _

A

add(E) - Method in class info.debatty.java.util.BoundedPriorityQueue

When the queue is full, adds the element if it is larger than the smallest element already in the queue.

B

BoundedPriorityQueue<E> - Class in info.debatty.java.util

This class implements a bounded priority queue A structure that always keeps the n 'largest' elements

BoundedPriorityQueue(int) - Constructor for class info.debatty.java.util.BoundedPriorityQueue

Create a bounded priority queue with given maximum capacity

BoundedPriorityQueue() - Constructor for class info.debatty.java.util.BoundedPriorityQueue

Creates a priority queue with maximum capacity Integer.MAX_VALUE

Brute<t> - Class in info.debatty.java.graphs.build

Brute() - Constructor for class info.debatty.java.graphs.build.Brute

BruteExample - Class in info.debatty.java.graphs.examples

BruteExample() - Constructor for class info.debatty.java.graphs.examples.BruteExample

C

c - Variable in class info.debatty.java.graphs.build.NNDescent

call(HashMap<String, Object>) - Method in interface info.debatty.java.graphs.CallbackInterface

callback - Variable in class info.debatty.java.graphs.build.GraphBuilder

CallbackInterface - Interface in info.debatty.java.graphs

CAPACITY - Variable in class info.debatty.java.util.BoundedPriorityQueue

clone() - Method in class info.debatty.java.graphs.build.GraphBuilder

compareTo(Object) - Method in class info.debatty.java.graphs.Neighbor

computed_similarities - Variable in class info.debatty.java.graphs.build.GraphBuilder

computeGraph(List<Node<t>>) - Method in class info.debatty.java.graphs.build.GraphBuilder

connectedComponents() - Method in class info.debatty.java.graphs.Graph

Split the graph in connected components (usually you will first prune the graph to remove "weak" edges).

Convert2Edges(HashMap<Node, NeighborList>) - Static method in class info.debatty.java.graphs.NeighborList

CountCommons(NeighborList) - Method in class info.debatty.java.graphs.NeighborList

Count the nodes (based on node.id) that are present in both neighborlists.

CountCommonValues(NeighborList) - Method in class info.debatty.java.graphs.NeighborList

Count the values (using node.value) that are present in both neighborlists.

D

delta - Variable in class info.debatty.java.graphs.build.NNDescent

Dijkstra - Class in info.debatty.java.graphs

Compute the shortest path (measured as the number of 'hops' from this source node to every other node in the graph using Dijkstra algorithm.

Dijkstra(Graph, Node) - Constructor for class info.debatty.java.graphs.Dijkstra

Compute the shortest path from source node to every other node in the graph.

DijkstraExample - Class in info.debatty.java.graphs.examples

DijkstraExample() - Constructor for class info.debatty.java.graphs.examples.DijkstraExample

E

Edge - Class in info.debatty.java.graphs

Represent a weighted edge (a link from node n1 to node n2)

Edge() - Constructor for class info.debatty.java.graphs.Edge

Edge(Node, Node, double) - Constructor for class info.debatty.java.graphs.Edge

equals(Object) - Method in class info.debatty.java.graphs.Neighbor

equals(Object) - Method in class info.debatty.java.graphs.Node

estimatedSpeedup() - Method in class info.debatty.java.graphs.build.GraphBuilder

estimatedSpeedup() - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

G

get(Node) - Method in class info.debatty.java.graphs.Graph

Get the neighborlist of this node

getC() - Method in class info.debatty.java.graphs.build.NNDescent

Get the number of edges modified at the last iteration

getCallback() - Method in class info.debatty.java.graphs.build.GraphBuilder

getComputedSimilarities() - Method in class info.debatty.java.graphs.build.GraphBuilder

getDelta() - Method in class info.debatty.java.graphs.build.NNDescent

getInternalBuilder() - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

getIterations() - Method in class info.debatty.java.graphs.build.NNDescent

Get the number of executed iterations

getK() - Method in class info.debatty.java.graphs.build.GraphBuilder

getLargestDistance() - Method in class info.debatty.java.graphs.Dijkstra

Return the distance (measured as the number of hops) to the most distant node

getMaxIterations() - Method in class info.debatty.java.graphs.build.NNDescent

getNPartitions() - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

Default = 4

getOversampling() - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

getPath(Node) - Method in class info.debatty.java.graphs.Dijkstra

Return the path from the source to the selected target

getRho() - Method in class info.debatty.java.graphs.build.NNDescent

getSimilarity() - Method in class info.debatty.java.graphs.build.GraphBuilder

getThreadCount() - Method in class info.debatty.java.graphs.build.ThreadedNNDescent

Graph<T> - Class in info.debatty.java.graphs

k-nn graph, represented as a mapping node => neighborlist

Graph(int) - Constructor for class info.debatty.java.graphs.Graph

Graph() - Constructor for class info.debatty.java.graphs.Graph

GraphBuilder<t> - Class in info.debatty.java.graphs.build

GraphBuilder() - Constructor for class info.debatty.java.graphs.build.GraphBuilder

H

hashCode() - Method in class info.debatty.java.graphs.Neighbor

hashCode() - Method in class info.debatty.java.graphs.Node

I

id - Variable in class info.debatty.java.graphs.Node

info.debatty.java.graphs - package info.debatty.java.graphs

info.debatty.java.graphs.build - package info.debatty.java.graphs.build

info.debatty.java.graphs.examples - package info.debatty.java.graphs.examples

info.debatty.java.util - package info.debatty.java.util

internal_builder - Variable in class info.debatty.java.graphs.build.PartitioningGraphBuilder

is_new - Variable in class info.debatty.java.graphs.Neighbor

iterations - Variable in class info.debatty.java.graphs.build.NNDescent

K

k - Variable in class info.debatty.java.graphs.build.GraphBuilder

M

main(String[]) - Static method in class info.debatty.java.graphs.examples.BruteExample

main(String[]) - Static method in class info.debatty.java.graphs.examples.DijkstraExample

main(String[]) - Static method in class info.debatty.java.graphs.examples.NNCTPHExample

main(String[]) - Static method in class info.debatty.java.graphs.examples.NNDescentExample

main(String[]) - Static method in class info.debatty.java.graphs.examples.SearchExample

main(String[]) - Static method in class info.debatty.java.graphs.examples.StronglyConnectedExample

main(String[]) - Static method in class info.debatty.java.graphs.examples.ThreadedNNDescentExample

MakeFullyLinked(List<Node<T>>) - Method in class info.debatty.java.graphs.build.NNDescent

max_iterations - Variable in class info.debatty.java.graphs.build.NNDescent

N

n1 - Variable in class info.debatty.java.graphs.Edge

n2 - Variable in class info.debatty.java.graphs.Edge

n_partitions - Variable in class info.debatty.java.graphs.build.PartitioningGraphBuilder

Neighbor - Class in info.debatty.java.graphs

Neighbor of an edge (stores the other node, and the similarity)

Neighbor() - Constructor for class info.debatty.java.graphs.Neighbor

Neighbor(Node, double) - Constructor for class info.debatty.java.graphs.Neighbor

NeighborList - Class in info.debatty.java.graphs

Bounded list of neighbors

NeighborList(int) - Constructor for class info.debatty.java.graphs.NeighborList

NNCTPH - Class in info.debatty.java.graphs.build

Builds the k-nn graph by partitioning the graph using Context Triggered Piecewize Hashing.

NNCTPH() - Constructor for class info.debatty.java.graphs.build.NNCTPH

NNCTPHExample - Class in info.debatty.java.graphs.examples

NNCTPHExample() - Constructor for class info.debatty.java.graphs.examples.NNCTPHExample

NNDescent<T> - Class in info.debatty.java.graphs.build

Implementation of NN-Descent k-nn graph building algorithm.

NNDescent() - Constructor for class info.debatty.java.graphs.build.NNDescent

NNDescentExample - Class in info.debatty.java.graphs.examples

NNDescentExample() - Constructor for class info.debatty.java.graphs.examples.NNDescentExample

node - Variable in class info.debatty.java.graphs.Neighbor

Node<T> - Class in info.debatty.java.graphs

The nodes of a graph have an id (String) and a value (type T)

Node() - Constructor for class info.debatty.java.graphs.Node

Node(String) - Constructor for class info.debatty.java.graphs.Node

Node(String, T) - Constructor for class info.debatty.java.graphs.Node

O

oversampling - Variable in class info.debatty.java.graphs.build.PartitioningGraphBuilder

P

PartitioningGraphBuilder<T> - Class in info.debatty.java.graphs.build

Abstract class for graph building algorithms that split the dataset into partitions (for example using LSH).

PartitioningGraphBuilder() - Constructor for class info.debatty.java.graphs.build.PartitioningGraphBuilder

PickFalses(NeighborList) - Method in class info.debatty.java.graphs.build.NNDescent

PickTruesAndMark(NeighborList) - Method in class info.debatty.java.graphs.build.NNDescent

pick new neighbors with a probability of rho, and mark them as false

prune(double) - Method in class info.debatty.java.graphs.Graph

Remove from the graph all edges with a similarity lower than threshold

R

RandomNeighborList(List<Node<T>>, Node) - Method in class info.debatty.java.graphs.build.NNDescent

readFile(String) - Static method in class info.debatty.java.graphs.build.GraphBuilder

Reverse(List<Node<T>>, HashMap<Node<T>, ArrayList>) - Method in class info.debatty.java.graphs.build.NNDescent

rho - Variable in class info.debatty.java.graphs.build.NNDescent

S

Sample(ArrayList<Node>, int) - Method in class info.debatty.java.graphs.build.NNDescent

Reverse NN array R[v] is the list of elements (u) for which v is a neighbor (v is in B[u])

search(T, int, SimilarityInterface<T>, int) - Method in class info.debatty.java.graphs.Graph

Perform approximate k-nn search on this graph.

search(T, int, SimilarityInterface<T>, int, int, double) - Method in class info.debatty.java.graphs.Graph

Implementation of Graph Nearest Neighbor Search (GNNS) algorithm from paper "Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph" by Hajebi et al.

SearchExample - Class in info.debatty.java.graphs.examples

SearchExample() - Constructor for class info.debatty.java.graphs.examples.SearchExample

SEPARATOR - Static variable in class info.debatty.java.graphs.Edge

setCallback(CallbackInterface) - Method in class info.debatty.java.graphs.build.GraphBuilder

setDelta(double) - Method in class info.debatty.java.graphs.build.NNDescent

Early termination coefficient.

setInternalBuilder(GraphBuilder) - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

Default = Brute force

setK(int) - Method in class info.debatty.java.graphs.build.GraphBuilder

Define k the number of edges per node.

setMaxIterations(int) - Method in class info.debatty.java.graphs.build.NNDescent

Set the maximum number of iterations Default is no max (Integer.MAX_VALUE)

setNPartitions(int) - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

Set the number of partitions to build for each stage.

setOversampling(int) - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

Default = 2

setRho(double) - Method in class info.debatty.java.graphs.build.NNDescent

Sampling coefficient.

setSimilarity(SimilarityInterface<t>) - Method in class info.debatty.java.graphs.build.GraphBuilder

setThreadCount(int) - Method in class info.debatty.java.graphs.build.ThreadedNNDescent

Set the number of threads Default is 4

similarity - Variable in class info.debatty.java.graphs.build.GraphBuilder

Similarity(Node, Node) - Method in class info.debatty.java.graphs.build.NNDescent

similarity - Variable in class info.debatty.java.graphs.Neighbor

similarity(t, t) - Method in interface info.debatty.java.graphs.SimilarityInterface

SimilarityInterface<t> - Interface in info.debatty.java.graphs

stronglyConnectedComponents() - Method in class info.debatty.java.graphs.Graph

Computes the strongly connected sub-graphs (where every node is reachable from every other node) using Tarjan's algorithm, which has computation cost O(n).

StronglyConnectedExample - Class in info.debatty.java.graphs.examples

StronglyConnectedExample() - Constructor for class info.debatty.java.graphs.examples.StronglyConnectedExample

T

test(List<Node<t>>) - Method in class info.debatty.java.graphs.build.GraphBuilder

Build the approximate graph, then use brute-force to build the exact graph and compare the results

thread_count - Variable in class info.debatty.java.graphs.build.ThreadedNNDescent

ThreadedNNDescent<T> - Class in info.debatty.java.graphs.build

ThreadedNNDescent() - Constructor for class info.debatty.java.graphs.build.ThreadedNNDescent

ThreadedNNDescentExample - Class in info.debatty.java.graphs.examples

ThreadedNNDescentExample() - Constructor for class info.debatty.java.graphs.examples.ThreadedNNDescentExample

toString() - Method in class info.debatty.java.graphs.Edge

toString() - Method in class info.debatty.java.graphs.Neighbor

toString() - Method in class info.debatty.java.graphs.Node

U

Union(ArrayList<Node>, ArrayList<Node>) - Method in class info.debatty.java.graphs.build.NNDescent

UpdateNL(NeighborList, Node, double) - Method in class info.debatty.java.graphs.build.NNDescent

V

value - Variable in class info.debatty.java.graphs.Node

W

weight - Variable in class info.debatty.java.graphs.Edge

writeGEXF(String) - Method in class info.debatty.java.graphs.Graph

Writes the graph as a GEXF file (to be used in Gephi, for example)

_

_computeGraph(List<Node<t>>) - Method in class info.debatty.java.graphs.build.Brute

_computeGraph(List<Node<t>>) - Method in class info.debatty.java.graphs.build.GraphBuilder

_computeGraph(List<Node<T>>) - Method in class info.debatty.java.graphs.build.NNDescent

_computeGraph(List<Node<T>>) - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

_computeGraph(List<Node<T>>) - Method in class info.debatty.java.graphs.build.ThreadedNNDescent

_partition(List<Node<String>>) - Method in class info.debatty.java.graphs.build.NNCTPH

_partition(List<Node<T>>) - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

A B C D E G H I K M N O P R S T U V W _