energy.evaluation

Class SparseGraph<V,E>

java.lang.Object

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

energy.evaluation.SparseGraph<V,E>

All Implemented Interfaces:

edu.uci.ics.jung.graph.Graph<V,E>, edu.uci.ics.jung.graph.Hypergraph<V,E>, java.io.Serializable

Direct Known Subclasses:

EvaluationGraphPart

public class SparseGraph<V,E>
extends edu.uci.ics.jung.graph.AbstractGraph<V,E>
implements edu.uci.ics.jung.graph.Graph<V,E>

An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
protected java.util.Map<E,edu.uci.ics.jung.graph.util.Pair<V>>	directed_edges
protected static int	INCIDENT
protected static int	INCOMING
protected static int	OUTGOING
protected java.util.Map<E,edu.uci.ics.jung.graph.util.Pair<V>>	undirected_edges
protected java.util.Map<V,java.util.Map<V,E>[]>	vertex_maps

Constructor Summary

Constructors

Constructor and Description
SparseGraph() Creates an instance.

Method Summary

Modifier and Type	Method and Description
boolean	addEdge(E 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(E edge)
boolean	containsVertex(V vertex)
E	findEdge(V v1, V v2)
java.util.Collection<E>	findEdgeSet(V v1, V v2)
edu.uci.ics.jung.graph.util.EdgeType	getDefaultEdgeType()
V	getDest(E directed_edge)
int	getEdgeCount()
int	getEdgeCount(edu.uci.ics.jung.graph.util.EdgeType edge_type)
java.util.Collection<E>	getEdges()
java.util.Collection<E>	getEdges(edu.uci.ics.jung.graph.util.EdgeType edgeType)
edu.uci.ics.jung.graph.util.EdgeType	getEdgeType(E edge)
edu.uci.ics.jung.graph.util.Pair<V>	getEndpoints(E edge)
static <V,E> org.apache.commons.collections15.Factory<edu.uci.ics.jung.graph.Graph<V,E>>	getFactory() Returns a Factory that creates an instance of this graph type.
java.util.Collection<E>	getIncidentEdges(V vertex)
java.util.Collection<E>	getInEdges(V vertex)
java.util.Collection<V>	getNeighbors(V vertex)
java.util.Collection<E>	getOutEdges(V vertex)
java.util.Collection<V>	getPredecessors(V vertex)
V	getSource(E directed_edge)
java.util.Collection<V>	getSuccessors(V vertex)
int	getVertexCount()
java.util.Collection<V>	getVertices()
boolean	isDest(V vertex, E edge)
boolean	isSource(V vertex, E edge)
boolean	removeEdge(E edge)
boolean	removeVertex(V vertex)

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

addEdge, addEdge, addEdge, addEdge, addEdge, degree, 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, getIncidentCount, getIncidentVertices, getNeighborCount, isIncident, isNeighbor

Field Detail

INCOMING

protected static final int INCOMING

See Also:

Constant Field Values

OUTGOING

protected static final int OUTGOING

See Also:

Constant Field Values

INCIDENT

protected static final int INCIDENT

See Also:

Constant Field Values

vertex_maps

protected java.util.Map<V,java.util.Map<V,E>[]> vertex_maps

directed_edges

protected java.util.Map<E,edu.uci.ics.jung.graph.util.Pair<V>> directed_edges

undirected_edges

protected java.util.Map<E,edu.uci.ics.jung.graph.util.Pair<V>> undirected_edges

Constructor Detail

SparseGraph

public SparseGraph()

Creates an instance.

Method Detail

getFactory

public static <V,E> org.apache.commons.collections15.Factory<edu.uci.ics.jung.graph.Graph<V,E>> getFactory()

Returns a Factory that creates an instance of this graph type.

Type Parameters:

V - the vertex type for the graph factory

E - the edge type for the graph factory

findEdge

public E findEdge(V v1,
                  V v2)

Specified by:

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

Overrides:

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

findEdgeSet

public java.util.Collection<E> findEdgeSet(V v1,
                                           V v2)

Specified by:

findEdgeSet in interface edu.uci.ics.jung.graph.Hypergraph<V,E>

Overrides:

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

addEdge

public boolean addEdge(E 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,E>

getInEdges

public java.util.Collection<E> getInEdges(V vertex)

Specified by:

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

Specified by:

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

getOutEdges

public java.util.Collection<E> getOutEdges(V vertex)

Specified by:

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

Specified by:

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

getPredecessors

public java.util.Collection<V> getPredecessors(V vertex)

Specified by:

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

Specified by:

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

getSuccessors

public java.util.Collection<V> getSuccessors(V vertex)

Specified by:

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

Specified by:

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

getEdges

public java.util.Collection<E> getEdges(edu.uci.ics.jung.graph.util.EdgeType edgeType)

Specified by:

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

getEndpoints

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

Specified by:

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

getEdgeType

public edu.uci.ics.jung.graph.util.EdgeType getEdgeType(E edge)

Specified by:

getEdgeType in interface edu.uci.ics.jung.graph.Hypergraph<V,E>

getSource

public V getSource(E directed_edge)

Specified by:

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

Specified by:

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

getDest

public V getDest(E directed_edge)

Specified by:

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

Specified by:

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

isSource

public boolean isSource(V vertex,
                        E edge)

Specified by:

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

isDest

public boolean isDest(V vertex,
                      E edge)

Specified by:

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

getEdges

public java.util.Collection<E> getEdges()

Specified by:

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

getVertices

public java.util.Collection<V> getVertices()

Specified by:

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

containsVertex

public boolean containsVertex(V vertex)

Specified by:

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

containsEdge

public boolean containsEdge(E edge)

Specified by:

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

getEdgeCount

public int getEdgeCount()

Specified by:

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

getVertexCount

public int getVertexCount()

Specified by:

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

getNeighbors

public java.util.Collection<V> getNeighbors(V vertex)

Specified by:

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

getIncidentEdges

public java.util.Collection<E> getIncidentEdges(V vertex)

Specified by:

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

addVertex

public boolean addVertex(V vertex)

Specified by:

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

removeVertex

public boolean removeVertex(V vertex)

Specified by:

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

removeEdge

public boolean removeEdge(E edge)

Specified by:

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

getEdgeCount

public int getEdgeCount(edu.uci.ics.jung.graph.util.EdgeType edge_type)

Specified by:

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

getDefaultEdgeType

public edu.uci.ics.jung.graph.util.EdgeType getDefaultEdgeType()

Specified by:

getDefaultEdgeType in interface edu.uci.ics.jung.graph.Hypergraph<V,E>