org.expasy.mzjava.core.ms.cluster

Class JungSimGraphWrapper<V>

java.lang.Object

edu.uci.ics.jung.graph.AbstractGraph<V,E>

edu.uci.ics.jung.graph.AbstractTypedGraph<V,SimEdge<V>>

org.expasy.mzjava.core.ms.cluster.JungSimGraphWrapper<V>

All Implemented Interfaces:

edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>, edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>, edu.uci.ics.jung.graph.UndirectedGraph<V,SimEdge<V>>, Serializable

public class JungSimGraphWrapper<V>
extends edu.uci.ics.jung.graph.AbstractTypedGraph<V,SimEdge<V>>
implements edu.uci.ics.jung.graph.UndirectedGraph<V,SimEdge<V>>

Wraps a SimilarityGraph in a jung.UndirectedGraph so that the JUNG algorithms can be used.

Version:

sqrt -1

Author:

Oliver Horlacher

See Also:

Serialized Form

Field Summary

Fields inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

edge_type

Constructor Summary

Constructors

Constructor and Description
JungSimGraphWrapper(SimilarityGraph<V> simGraph)

Method Summary

Methods

Modifier and Type	Method and Description
boolean	addEdge(SimEdge<V> edge, edu.uci.ics.jung.graph.util.Pair<? extends V> endpoints, edu.uci.ics.jung.graph.util.EdgeType edgeType)
boolean	addVertex(V vertex)
boolean	containsEdge(SimEdge<V> edge)
boolean	containsVertex(V vertex)
SimEdge<V>	findEdge(V v1, V v2)
V	getDest(SimEdge<V> directedEdge)
int	getEdgeCount()
Collection<SimEdge<V>>	getEdges()
edu.uci.ics.jung.graph.util.Pair<V>	getEndpoints(SimEdge<V> edge)
Collection<SimEdge<V>>	getIncidentEdges(V vertex)
Collection<SimEdge<V>>	getInEdges(V vertex)
Collection<V>	getNeighbors(V vertex)
Collection<SimEdge<V>>	getOutEdges(V vertex)
Collection<V>	getPredecessors(V vertex)
V	getSource(SimEdge<V> directedEdge)
Collection<V>	getSuccessors(V vertex)
int	getVertexCount()
Collection<V>	getVertices()
boolean	isDest(V vertex, SimEdge<V> edge)
boolean	isSource(V vertex, SimEdge<V> edge)
boolean	removeEdge(SimEdge<V> edge)
boolean	removeVertex(V vertex)

Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeType

Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph

addEdge, addEdge, addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString

Methods inherited from class java.lang.Object

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

Methods inherited from interface edu.uci.ics.jung.graph.Graph

addEdge, addEdge, getOpposite, getPredecessorCount, getSuccessorCount, inDegree, isPredecessor, isSuccessor, outDegree

Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph

addEdge, addEdge, degree, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, isIncident, isNeighbor

Constructor Detail

JungSimGraphWrapper

public JungSimGraphWrapper(SimilarityGraph<V> simGraph)

Method Detail

addEdge

public boolean addEdge(SimEdge<V> edge,
              edu.uci.ics.jung.graph.util.Pair<? extends V> endpoints,
              edu.uci.ics.jung.graph.util.EdgeType edgeType)

Specified by:

addEdge in class edu.uci.ics.jung.graph.AbstractGraph<V,SimEdge<V>>

getInEdges

public Collection<SimEdge<V>> getInEdges(V vertex)

Specified by:

getInEdges in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

Specified by:

getInEdges in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getOutEdges

public Collection<SimEdge<V>> getOutEdges(V vertex)

Specified by:

getOutEdges in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

Specified by:

getOutEdges in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getPredecessors

public Collection<V> getPredecessors(V vertex)

Specified by:

getPredecessors in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

Specified by:

getPredecessors in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getSuccessors

public Collection<V> getSuccessors(V vertex)

Specified by:

getSuccessors in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

Specified by:

getSuccessors in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

findEdge

public SimEdge<V> findEdge(V v1,
                  V v2)

Specified by:

findEdge in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

Overrides:

findEdge in class edu.uci.ics.jung.graph.AbstractGraph<V,SimEdge<V>>

getEndpoints

public edu.uci.ics.jung.graph.util.Pair<V> getEndpoints(SimEdge<V> edge)

Specified by:

getEndpoints in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

getSource

public V getSource(SimEdge<V> directedEdge)

Specified by:

getSource in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

Specified by:

getSource in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getDest

public V getDest(SimEdge<V> directedEdge)

Specified by:

getDest in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

Specified by:

getDest in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

isSource

public boolean isSource(V vertex,
               SimEdge<V> edge)

Specified by:

isSource in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

isDest

public boolean isDest(V vertex,
             SimEdge<V> edge)

Specified by:

isDest in interface edu.uci.ics.jung.graph.Graph<V,SimEdge<V>>

getEdges

public Collection<SimEdge<V>> getEdges()

Specified by:

getEdges in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getVertices

public Collection<V> getVertices()

Specified by:

getVertices in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

containsVertex

public boolean containsVertex(V vertex)

Specified by:

containsVertex in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

containsEdge

public boolean containsEdge(SimEdge<V> edge)

Specified by:

containsEdge in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getEdgeCount

public int getEdgeCount()

Specified by:

getEdgeCount in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getVertexCount

public int getVertexCount()

Specified by:

getVertexCount in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getNeighbors

public Collection<V> getNeighbors(V vertex)

Specified by:

getNeighbors in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

getIncidentEdges

public Collection<SimEdge<V>> getIncidentEdges(V vertex)

Specified by:

getIncidentEdges in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

addVertex

public boolean addVertex(V vertex)

Specified by:

addVertex in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

removeVertex

public boolean removeVertex(V vertex)

Specified by:

removeVertex in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>

removeEdge

public boolean removeEdge(SimEdge<V> edge)

Specified by:

removeEdge in interface edu.uci.ics.jung.graph.Hypergraph<V,SimEdge<V>>