| Package | Description |
|---|---|
| org.expasy.mzjava.core.ms.cluster |
| Modifier and Type | Method and Description |
|---|---|
SimEdge<V> |
DenseSimilarityGraph.AbstractBuilder.add(V vertex1,
V vertex2,
double score) |
SimEdge<V> |
SimilarityGraphBuilder.add(V vertex1,
V vertex2,
double score)
Create and add an edge from
vertex1 to vertex2 with similarity
equal to score to the graph. |
SimEdge<V> |
SparseSimilarityGraph.Builder.add(V vertex1,
V vertex2,
double score) |
SimEdge<V> |
JungSimGraphWrapper.findEdge(V v1,
V v2) |
| Modifier and Type | Method and Description |
|---|---|
com.google.common.base.Optional<SimEdge<V>> |
SimilarityGraph.findEdge(V vertex1,
V vertex2)
Find the edge between
vertex1 and vertex2. |
com.google.common.base.Optional<SimEdge<V>> |
DenseSimilarityGraph.findEdge(V vertex1,
V vertex2) |
com.google.common.base.Optional<SimEdge<V>> |
SparseSimilarityGraph.findEdge(V vertex1,
V vertex2) |
Iterable<SimEdge<V>> |
SimilarityGraph.getEdges()
Return an Iterable that iterates over the SimEdge's in this graph.
|
Iterable<SimEdge<V>> |
DenseSimilarityGraph.getEdges() |
Collection<SimEdge<V>> |
JungSimGraphWrapper.getEdges() |
Iterable<SimEdge<V>> |
SparseSimilarityGraph.getEdges() |
Iterable<SimEdge<V>> |
SimilarityGraph.getEdges(V vertex)
Return an Iterable that iterates over all the edges connected to
vertex. |
Iterable<SimEdge<V>> |
DenseSimilarityGraph.getEdges(V vertex) |
Iterable<SimEdge<V>> |
SparseSimilarityGraph.getEdges(V vertex) |
Collection<SimEdge<V>> |
JungSimGraphWrapper.getIncidentEdges(V vertex) |
Collection<SimEdge<V>> |
JungSimGraphWrapper.getInEdges(V vertex) |
Collection<SimEdge<V>> |
JungSimGraphWrapper.getOutEdges(V vertex) |
| Modifier and Type | Method and Description |
|---|---|
SimilarityGraphBuilder<V,G> |
DenseSimilarityGraph.AbstractBuilder.add(SimEdge<V> simEdge) |
SimilarityGraphBuilder<V,G> |
SimilarityGraphBuilder.add(SimEdge<V> simEdge)
Add the
simEdge to the graph. |
SparseSimilarityGraph.Builder<V> |
SparseSimilarityGraph.Builder.add(SimEdge<V> edge) |
boolean |
JungSimGraphWrapper.addEdge(SimEdge<V> edge,
edu.uci.ics.jung.graph.util.Pair<? extends V> endpoints,
edu.uci.ics.jung.graph.util.EdgeType edgeType) |
boolean |
JungSimGraphWrapper.containsEdge(SimEdge<V> edge) |
protected DenseSimilarityGraph<V> |
DenseSimilarityGraph.Builder.doBuild(gnu.trove.map.TObjectIntMap<V> vertexIndexMap,
int edgeCount,
SimEdge<V>[][] adjacencyList) |
protected abstract G |
DenseSimilarityGraph.AbstractBuilder.doBuild(gnu.trove.map.TObjectIntMap<V> vertexIndexMap,
int edgeCount,
SimEdge<V>[][] adjacencyList) |
V |
JungSimGraphWrapper.getDest(SimEdge<V> directedEdge) |
edu.uci.ics.jung.graph.util.Pair<V> |
JungSimGraphWrapper.getEndpoints(SimEdge<V> edge) |
V |
JungSimGraphWrapper.getSource(SimEdge<V> directedEdge) |
boolean |
JungSimGraphWrapper.isDest(V vertex,
SimEdge<V> edge) |
boolean |
JungSimGraphWrapper.isSource(V vertex,
SimEdge<V> edge) |
boolean |
JungSimGraphWrapper.removeEdge(SimEdge<V> edge) |
| Modifier and Type | Method and Description |
|---|---|
void |
SimilarityGraph.forEachEdge(Procedure<SimEdge<V>> procedure)
Applies the procedure to each edge in this graph
|
void |
DenseSimilarityGraph.forEachEdge(Procedure<SimEdge<V>> procedure) |
void |
SparseSimilarityGraph.forEachEdge(Procedure<SimEdge<V>> procedure) |
void |
SimilarityGraph.forEachEdge(V vertex,
Procedure<SimEdge<V>> procedure)
Applies the procedure to each edge that is connected to
vertex |
void |
DenseSimilarityGraph.forEachEdge(V vertex,
Procedure<SimEdge<V>> procedure) |
void |
SparseSimilarityGraph.forEachEdge(V vertex,
Procedure<SimEdge<V>> procedure) |
| Constructor and Description |
|---|
DenseSimilarityGraph(gnu.trove.map.TObjectIntMap<V> vertexIndexMap,
SimEdge<V>[][] adjacencyList,
int edgeCount) |
| Constructor and Description |
|---|
MSTClusterBuilder(double scoreThreshold,
DoubleFunction<SimEdge<V>> scoreMapper) |
Copyright © 2016. All Rights Reserved.