info.debatty.java.graphs.build

Class GraphBuilder<t>

java.lang.Object

info.debatty.java.graphs.build.GraphBuilder<t>

Type Parameters:

t -

All Implemented Interfaces:

Serializable, Cloneable

Direct Known Subclasses:

Brute, NNDescent, PartitioningGraphBuilder

public abstract class GraphBuilder<t>
extends Object
implements Cloneable, Serializable

Author:

Thibault Debatty

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
protected CallbackInterface	callback
protected int	computed_similarities
protected int	k
protected SimilarityInterface<t>	similarity

Constructor Summary

Constructors

Constructor and Description
GraphBuilder()

Method Summary

Methods

Modifier and Type	Method and Description
protected abstract Graph<t>	_computeGraph(List<Node<t>> nodes)
Object	clone()
Graph<t>	computeGraph(List<Node<t>> nodes)
double	estimatedSpeedup()
CallbackInterface	getCallback()
int	getComputedSimilarities()
int	getK()
SimilarityInterface	getSimilarity()
static ArrayList<Node<String>>	readFile(String path)
void	setCallback(CallbackInterface callback)
void	setK(int k) Define k the number of edges per node.
void	setSimilarity(SimilarityInterface<t> similarity)
void	test(List<Node<t>> nodes) Build the approximate graph, then use brute-force to build the exact graph and compare the results

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

k

protected int k

similarity

protected SimilarityInterface<t> similarity

callback

protected CallbackInterface callback

computed_similarities

protected int computed_similarities

Constructor Detail

GraphBuilder

public GraphBuilder()

Method Detail

getK

public int getK()

setK

public void setK(int k)

Define k the number of edges per node. Default value is 10

Parameters:

k -

getSimilarity

public SimilarityInterface getSimilarity()

setSimilarity

public void setSimilarity(SimilarityInterface<t> similarity)

getCallback

public CallbackInterface getCallback()

setCallback

public void setCallback(CallbackInterface callback)

getComputedSimilarities

public int getComputedSimilarities()

computeGraph

public Graph<t> computeGraph(List<Node<t>> nodes)

test

public void test(List<Node<t>> nodes)

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

Parameters:

nodes -

estimatedSpeedup

public double estimatedSpeedup()

readFile

public static ArrayList<Node<String>> readFile(String path)

clone

public Object clone()
             throws CloneNotSupportedException

Overrides:

clone in class Object

Throws:

CloneNotSupportedException

_computeGraph

protected abstract Graph<t> _computeGraph(List<Node<t>> nodes)