org.expasy.mzjava.core.ms.cluster

Class DenseSimilarityGraph.AbstractBuilder<V,G extends SimilarityGraph<V>>

java.lang.Object

org.expasy.mzjava.core.ms.cluster.DenseSimilarityGraph.AbstractBuilder<V,G>

All Implemented Interfaces:

SimilarityGraphBuilder<V,G>

Direct Known Subclasses:

DenseSimilarityGraph.Builder

Enclosing class:

DenseSimilarityGraph<V>

protected abstract static class DenseSimilarityGraph.AbstractBuilder<V,G extends SimilarityGraph<V>>
extends Object
implements SimilarityGraphBuilder<V,G>

Constructor Summary

Constructors

Constructor and Description
DenseSimilarityGraph.AbstractBuilder(boolean useIdentityHash)

Method Summary

Methods

Modifier and Type	Method and Description
SimilarityGraphBuilder<V,G>	add(SimEdge<V> simEdge) Add the simEdge to the graph.
SimilarityGraphBuilder<V,G>	add(V vertex) Add the vertex to the graph
SimEdge<V>	add(V vertex1, V vertex2, double score) Create and add an edge from vertex1 to vertex2 with similarity equal to score to the graph.
G	build()
protected abstract G	doBuild(gnu.trove.map.TObjectIntMap<V> vertexIndexMap, int edgeCount, SimEdge<V>[][] adjacencyList)
int	edgeCount() Return the number of edges currently in the graph
boolean	isReusable() Returns true if build can be called more than once, false otherwise.

Methods inherited from class java.lang.Object

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

Constructor Detail

DenseSimilarityGraph.AbstractBuilder

public DenseSimilarityGraph.AbstractBuilder(boolean useIdentityHash)

Method Detail

add

public SimilarityGraphBuilder<V,G> add(V vertex)

Description copied from interface: SimilarityGraphBuilder

Add the vertex to the graph

Specified by:

add in interface SimilarityGraphBuilder<V,G extends SimilarityGraph<V>>

Parameters:

vertex - the vertex to add

Returns:

this builder

add

public SimEdge<V> add(V vertex1,
             V vertex2,
             double score)

Description copied from interface: SimilarityGraphBuilder

Create and add an edge from vertex1 to vertex2 with similarity equal to score to the graph.

If a vertex is not present in the graph the vertex is added to the graph.

Specified by:

add in interface SimilarityGraphBuilder<V,G extends SimilarityGraph<V>>

Parameters:

vertex1 - the parent vertex

vertex2 - the child vertex

score - the similarity of the edge

Returns:

the created edge

build

public G build()

Specified by:

build in interface SimilarityGraphBuilder<V,G extends SimilarityGraph<V>>

doBuild

protected abstract G doBuild(gnu.trove.map.TObjectIntMap<V> vertexIndexMap,
        int edgeCount,
        SimEdge<V>[][] adjacencyList)

isReusable

public boolean isReusable()

Description copied from interface: SimilarityGraphBuilder

Returns true if build can be called more than once, false otherwise.

Specified by:

isReusable in interface SimilarityGraphBuilder<V,G extends SimilarityGraph<V>>

Returns:

true if build can be called more than once, false otherwise

edgeCount

public int edgeCount()

Description copied from interface: SimilarityGraphBuilder

Return the number of edges currently in the graph

Specified by:

edgeCount in interface SimilarityGraphBuilder<V,G extends SimilarityGraph<V>>

Returns:

the number of edges currently in the graph

add

public SimilarityGraphBuilder<V,G> add(SimEdge<V> simEdge)

Description copied from interface: SimilarityGraphBuilder

Add the simEdge to the graph.

Specified by:

add in interface SimilarityGraphBuilder<V,G extends SimilarityGraph<V>>

Parameters:

simEdge - the edge to add

Returns:

this builder