edu.uci.ics.jung.graph

Class AbstractGraph<V,E>

java.lang.Object

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

All Implemented Interfaces:

Graph<V,E>, Hypergraph<V,E>, Serializable

Direct Known Subclasses:

AbstractTypedGraph, SparseGraph, SparseMultigraph

public abstract class AbstractGraph<V,E>
extends Object
implements Graph<V,E>, Serializable

Abstract implementation of the Graph interface. Designed to simplify implementation of new graph classes.

Author:

Joshua O'Madadhain

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
AbstractGraph()

Method Summary

Modifier and Type	Method and Description
boolean	addEdge(E edge, Collection<? extends V> vertices)
boolean	addEdge(E edge, Collection<? extends V> vertices, EdgeType edgeType)
boolean	addEdge(E edge, Pair<? extends V> endpoints) Adds edge to this graph with the specified endpoints, with the default edge type.
abstract boolean	addEdge(E edge, Pair<? extends V> endpoints, EdgeType edgeType) Adds edge to this graph with the specified endpoints and EdgeType.
boolean	addEdge(E e, V v1, V v2)
boolean	addEdge(E e, V v1, V v2, EdgeType edge_type)
int	degree(V vertex)
E	findEdge(V v1, V v2)
Collection<E>	findEdgeSet(V v1, V v2)
int	getIncidentCount(E edge)
Collection<V>	getIncidentVertices(E edge)
int	getNeighborCount(V vertex)
V	getOpposite(V vertex, E edge)
int	getPredecessorCount(V vertex)
int	getSuccessorCount(V vertex)
protected Pair<V>	getValidatedEndpoints(E edge, Pair<? extends V> endpoints)
int	inDegree(V vertex)
boolean	isIncident(V vertex, E edge)
boolean	isNeighbor(V v1, V v2)
boolean	isPredecessor(V v1, V v2)
boolean	isSuccessor(V v1, V v2)
int	outDegree(V vertex)
String	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

getDest, getEndpoints, getInEdges, getOutEdges, getPredecessors, getSource, getSuccessors, isDest, isSource

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

addVertex, containsEdge, containsVertex, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentEdges, getNeighbors, getVertexCount, getVertices, removeEdge, removeVertex

Constructor Detail

AbstractGraph

public AbstractGraph()

Method Detail

addEdge

public boolean addEdge(E edge,
                       Collection<? extends V> vertices)

Specified by:

addEdge in interface Hypergraph<V,E>

addEdge

public boolean addEdge(E edge,
                       Collection<? extends V> vertices,
                       EdgeType edgeType)

Specified by:

addEdge in interface Hypergraph<V,E>

addEdge

public boolean addEdge(E e,
                       V v1,
                       V v2)

Specified by:

addEdge in interface Graph<V,E>

addEdge

public boolean addEdge(E e,
                       V v1,
                       V v2,
                       EdgeType edge_type)

Specified by:

addEdge in interface Graph<V,E>

addEdge

public boolean addEdge(E edge,
                       Pair<? extends V> endpoints)

Adds edge to this graph with the specified endpoints, with the default edge type.

Parameters:

edge - the edge to be added

endpoints - the endpoints to be connected to this edge

Returns:

true iff the graph was modified as a result of this call

addEdge

public abstract boolean addEdge(E edge,
                                Pair<? extends V> endpoints,
                                EdgeType edgeType)

Adds edge to this graph with the specified endpoints and EdgeType.

Parameters:

edge - the edge to be added

endpoints - the endpoints to be connected to this edge

edgeType - the type of edge to add

Returns:

true iff the graph was modified as a result of this call

getValidatedEndpoints

protected Pair<V> getValidatedEndpoints(E edge,
                                        Pair<? extends V> endpoints)

inDegree

public int inDegree(V vertex)

Specified by:

inDegree in interface Graph<V,E>

Specified by:

inDegree in interface Hypergraph<V,E>

outDegree

public int outDegree(V vertex)

Specified by:

outDegree in interface Graph<V,E>

Specified by:

outDegree in interface Hypergraph<V,E>

isPredecessor

public boolean isPredecessor(V v1,
                             V v2)

Specified by:

isPredecessor in interface Graph<V,E>

isSuccessor

public boolean isSuccessor(V v1,
                           V v2)

Specified by:

isSuccessor in interface Graph<V,E>

getPredecessorCount

public int getPredecessorCount(V vertex)

Specified by:

getPredecessorCount in interface Graph<V,E>

getSuccessorCount

public int getSuccessorCount(V vertex)

Specified by:

getSuccessorCount in interface Graph<V,E>

isNeighbor

public boolean isNeighbor(V v1,
                          V v2)

Specified by:

isNeighbor in interface Hypergraph<V,E>

isIncident

public boolean isIncident(V vertex,
                          E edge)

Specified by:

isIncident in interface Hypergraph<V,E>

getNeighborCount

public int getNeighborCount(V vertex)

Specified by:

getNeighborCount in interface Hypergraph<V,E>

degree

public int degree(V vertex)

Specified by:

degree in interface Hypergraph<V,E>

getIncidentCount

public int getIncidentCount(E edge)

Specified by:

getIncidentCount in interface Hypergraph<V,E>

getOpposite

public V getOpposite(V vertex,
                     E edge)

Specified by:

getOpposite in interface Graph<V,E>

findEdge

public E findEdge(V v1,
                  V v2)

Specified by:

findEdge in interface Hypergraph<V,E>

findEdgeSet

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

Specified by:

findEdgeSet in interface Hypergraph<V,E>

getIncidentVertices

public Collection<V> getIncidentVertices(E edge)

Specified by:

getIncidentVertices in interface Hypergraph<V,E>

toString

public String toString()

Overrides:

toString in class Object