info.debatty.java.graphs.build

Class GraphBuilder<T>

java.lang.Object

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

Type Parameters:

T - the actual type of the nodes

All Implemented Interfaces:

Serializable

Direct Known Subclasses:

Brute, NNDescent, PartitioningGraphBuilder, ThreadedBrute, ThreadedNNDescent

public abstract class GraphBuilder<T>
extends Object
implements Serializable

Author:

Thibault Debatty

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
static int	DEFAULT_K Default number of neighbors.

Constructor Summary

Constructors

Constructor and Description
GraphBuilder()

Method Summary

Modifier and Type	Method and Description
Graph<T>	computeGraph(List<T> nodes) Compute the graph.
protected abstract Graph<T>	computeGraph(List<T> nodes, int k, SimilarityInterface<T> similarity)
int	getComputedSimilarities()
int	getK()
SimilarityInterface	getSimilarity()
static LinkedList<String>	readFile(String path)
void	setK(int k) Define k the number of edges per node.
void	setSimilarity(SimilarityInterface<T> similarity)
void	test(List<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

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

Field Detail

DEFAULT_K

public static final int DEFAULT_K

Default number of neighbors.

See Also:

Constant Field Values

Constructor Detail

GraphBuilder

public GraphBuilder()

Method Detail

getK

public final int getK()

Returns:

setK

public final void setK(int k)

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

Parameters:

k -

getSimilarity

public final SimilarityInterface getSimilarity()

Returns:

setSimilarity

public final void setSimilarity(SimilarityInterface<T> similarity)

Parameters:

similarity -

getComputedSimilarities

public final int getComputedSimilarities()

Returns:

computeGraph

public final Graph<T> computeGraph(List<T> nodes)

Compute the graph.

Parameters:

nodes -

Returns:

test

public final void test(List<T> nodes)

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

Parameters:

nodes -

readFile

public static LinkedList<String> readFile(String path)
                                   throws FileNotFoundException,
                                          IOException

Parameters:

path -

Returns:

Throws:

FileNotFoundException - if file does not exist

IOException - if file cannot be read

computeGraph

protected abstract Graph<T> computeGraph(List<T> nodes,
                                         int k,
                                         SimilarityInterface<T> similarity)