A B C D E F G H I M N O P R S T W

A

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

Add a node to the online graph using exhaustive search approach.

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.

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

addAll(Collection<? extends E>) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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

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

CallbackInterface - Interface in info.debatty.java.graphs

clear() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

compare(Graph<T>) - Method in class info.debatty.java.graphs.Graph

Count the number of edges/neighbors that are the same (based on similarity) in both graphs.

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

This > other if this.similarity > other.similarity.

computeGraph(List<T>, int, SimilarityInterface<T>) - Method in class info.debatty.java.graphs.build.Brute

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

Compute the graph.

computeGraph(List<T>, int, SimilarityInterface<T>) - Method in class info.debatty.java.graphs.build.GraphBuilder

computeGraph(List<T>, int, SimilarityInterface<T>) - Method in class info.debatty.java.graphs.build.PartitioningGraphBuilder

computeGraph(List<T>, int, SimilarityInterface<T>) - Method in class info.debatty.java.graphs.build.ThreadedBrute

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).

contains(Object) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

containsAll(Collection<?>) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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

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

Returns true if this neighborlist contains a neighbor corresponding to this node.

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

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

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

Count the number of equivalent neighbors (using similarities).

D

DEFAULT_K - Static variable in class info.debatty.java.graphs.build.GraphBuilder

Default number of neighbors.

DEFAULT_K - Static variable in class info.debatty.java.graphs.Graph

Number of edges per node.

DEFAULT_SEARCH_EXPANSION - Static variable in class info.debatty.java.graphs.Graph

Fast search: expansion parameter.

DEFAULT_SEARCH_RANDOM_JUMPS - Static variable in class info.debatty.java.graphs.Graph

Fast search: number of random jumps per node (to simulate small world graph).

DEFAULT_SEARCH_SPEEDUP - Static variable in class info.debatty.java.graphs.Graph

Fast search: speedup compared to exhaustive search.

DEFAULT_UPDATE_DEPTH - Static variable in class info.debatty.java.graphs.Graph

Fast add or remove node: depth of search to update the graph.

Dijkstra<T> - 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, T) - 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<T> - Class in info.debatty.java.graphs

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

Edge(T, Neighbor<T>) - Constructor for class info.debatty.java.graphs.Edge

Build an edge between n1 and neighbor.node.

element() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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

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

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

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

A neighbor has no reference to the origin node, hence only neighbors from the same origin can be compared.

equals(Object) - Method in class info.debatty.java.util.BoundedPriorityQueue

equals(Object) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

F

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

Add a node to the online graph, using approximate online graph building algorithm presented in "Fast Online k-nn Graph Building" by Debatty et al.

fastAdd(T, double) - Method in class info.debatty.java.graphs.Graph

Add a node to the online graph, using approximate online graph building algorithm presented in "Fast Online k-nn Graph Building" by Debatty et al.

fastAdd(T, double, int, double) - Method in class info.debatty.java.graphs.Graph

Add a node to the online graph, using approximate online graph building algorithm presented in "Fast Online k-nn Graph Building" by Debatty et al.

fastAdd(T, double, int, double, int, StatisticsContainer) - Method in class info.debatty.java.graphs.Graph

Add a node to the online graph, using approximate online graph building algorithm presented in "Fast Online k-nn Graph Building" by Debatty et al.

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

Remove a node from the graph (and update the graph) using fast approximate algorithm.

fastRemove(T, int, StatisticsContainer) - Method in class info.debatty.java.graphs.Graph

Remove a node from the graph (and update the graph) using fast approximate algorithm.

fastSearch(T, int) - Method in class info.debatty.java.graphs.Graph

Approximate fast graph based search, as published in "Fast Online k-nn Graph Building" by Debatty et al.

fastSearch(T, int, double) - Method in class info.debatty.java.graphs.Graph

Approximate fast graph based search, as published in "Fast Online k-nn Graph Building" by Debatty et al.

fastSearch(T, int, double, int, double) - Method in class info.debatty.java.graphs.Graph

Approximate fast graph based search, as published in "Fast Online k-nn Graph Building" by Debatty et al.

fastSearch(T, int, double, int, double, StatisticsContainer) - Method in class info.debatty.java.graphs.Graph

Approximate fast graph based search, as published in "Fast Online k-nn Graph Building" by Debatty et al.

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

Recursively search neighbors of neighbors, up to a given depth.

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

Get the first node in the graph.

G

getAddSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

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

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

getCount() - Method in class info.debatty.java.graphs.build.SimilarityCounter

Get the number of computed similarities.

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

Get the underlying hash map that stores the nodes and associated neighborlists.

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

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

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

Get k (the number of edges per node).

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

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

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

Get the neighbor.

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

Get the neighborlist of this node.

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

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

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

Default = 4.

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

Get the origin of the edge (the source node).

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

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

Return the path from the source to the selected target.

getRemoveSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

getSearchCrossPartitionRestarts() - Method in class info.debatty.java.graphs.StatisticsContainer

getSearchRestarts() - Method in class info.debatty.java.graphs.StatisticsContainer

getSearchSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

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

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

getSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

Return the total number of computed similarities (search + add + remove).

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

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

Get the similarity measure.

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

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

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

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

Copy constructor.

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

Initialize an empty graph, and set k (number of edges per node).

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

Initialize an empty graph with k = 10.

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.Edge

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

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

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

hashCode() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

I

incAddSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

incAddSimilarities(int) - Method in class info.debatty.java.graphs.StatisticsContainer

incRemoveSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

incRemoveSimilarities(int) - Method in class info.debatty.java.graphs.StatisticsContainer

incSearchCrossPartitionRestarts() - Method in class info.debatty.java.graphs.StatisticsContainer

incSearchCrossPartitionRestarts(int) - Method in class info.debatty.java.graphs.StatisticsContainer

incSearchRestarts() - Method in class info.debatty.java.graphs.StatisticsContainer

incSearchRestarts(int) - Method in class info.debatty.java.graphs.StatisticsContainer

incSearchSimilarities() - Method in class info.debatty.java.graphs.StatisticsContainer

incSearchSimilarities(int) - Method in class info.debatty.java.graphs.StatisticsContainer

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

isEmpty() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

iterator() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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.PruneExample

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

N

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

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

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

NeighborList - Class in info.debatty.java.graphs

Bounded list of neighbors.

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

Copy constructor.

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

Create a new neighborlist of given size.

NNCTPH<T> - 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

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

nndescent(List<T>, SimilarityInterface<T>) - Method in class info.debatty.java.graphs.build.ThreadedNNDescent

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

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

NODES_PER_BLOCK - Static variable in class info.debatty.java.graphs.build.ThreadedBrute

Number of nodes per thread.

O

offer(E) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

P

partition(List<T>) - Method in class info.debatty.java.graphs.build.NNCTPH

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

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

peek() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

poll() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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

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

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

Remove all neighbors with similarity inferior to threshold.

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

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

put(T, NeighborList) - Method in class info.debatty.java.graphs.Graph

R

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

remove(Object) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

remove() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

removeAll(Collection<?>) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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

Remove from the neighborlist the neighbor corresponding to this node.

retainAll(Collection<?>) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

S

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

Multi-thread exhaustive search.

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

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

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.

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

Set k (the number of edges per node).

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.

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

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

Set the similarity measure used to build or search the graph.

similarity(T, T) - Method in class info.debatty.java.graphs.build.SimilarityCounter

Compute the similarity between two nodes.

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

Compute the similarity between two nodes.

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

Wraps a similarity interface with a counter, so we can check how many similarities were computed.

SimilarityCounter(SimilarityInterface<T>) - Constructor for class info.debatty.java.graphs.build.SimilarityCounter

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

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

size() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

StatisticsContainer - Class in info.debatty.java.graphs

This object will contain additional stats produced by fastSearch, fastAdd and fastRemove algorithms.

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

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

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

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

T

test(List<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.

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

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

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

toArray() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

toArray(T[]) - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

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

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

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

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

toString() - Method in class info.debatty.java.util.SynchronizedBoundedPriorityQueue

W

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

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

A B C D E F G H I M N O P R S T W