Serialized Form

Package info.debatty.java.graphs

Class info.debatty.java.graphs.Graph extends Object implements Serializable

Serialized Fields

map

HashMap<K,V> map

similarity

SimilarityInterface<t> similarity

k

int k

update_depth

int update_depth

window_size

int window_size

current_sequence

int current_sequence

Class info.debatty.java.graphs.Neighbor extends Object implements Serializable

Serialized Fields

node

Node<T> node

similarity

double similarity

attributes

HashMap<K,V> attributes

Class info.debatty.java.graphs.NeighborList extends BoundedPriorityQueue<Neighbor> implements Serializable

Class info.debatty.java.graphs.Node extends Object implements Serializable

Serialized Fields

id

String id

Unique id of the node.

value

Object value

Value of the node (used to compute similarity).

attributes

HashMap<K,V> attributes

Package info.debatty.java.graphs.build

Class info.debatty.java.graphs.build.Brute extends GraphBuilder<T> implements Serializable

Class info.debatty.java.graphs.build.GraphBuilder extends Object implements Serializable

Serialized Fields

k

int k

similarity

SimilarityInterface<t> similarity

callback

CallbackInterface callback

computed_similarities

int computed_similarities

Class info.debatty.java.graphs.build.NNCTPH extends PartitioningGraphBuilder<String> implements Serializable

Class info.debatty.java.graphs.build.NNDescent extends GraphBuilder<T> implements Serializable

Serialized Fields

rho

double rho

delta

double delta

max_iterations

int max_iterations

iterations

int iterations

c

int c

Class info.debatty.java.graphs.build.PartitioningGraphBuilder extends GraphBuilder<T> implements Serializable

Serialized Fields

oversampling

int oversampling

n_partitions

int n_partitions

internal_builder

GraphBuilder<T> internal_builder

Class info.debatty.java.graphs.build.ThreadedBrute extends GraphBuilder<T> implements Serializable

Class info.debatty.java.graphs.build.ThreadedNNDescent extends NNDescent<T> implements Serializable

Serialized Fields

cores

int cores

nodes

List<E> nodes

neighborlists

Graph<T> neighborlists

old_lists

HashMap<K,V> old_lists

new_lists

HashMap<K,V> new_lists

old_lists_2

HashMap<K,V> old_lists_2

new_lists_2

HashMap<K,V> new_lists_2

Package info.debatty.java.util

Class info.debatty.java.util.BoundedPriorityQueue extends PriorityQueue<E> implements Serializable

Serialized Fields

capacity

int capacity