Class Graphs.SynchronizedDirectedGraph<V,E>

java.lang.Object

edu.uci.ics.jung.graph.util.Graphs.SynchronizedAbstractGraph<V,E>

edu.uci.ics.jung.graph.util.Graphs.SynchronizedDirectedGraph<V,E>

All Implemented Interfaces:

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

Direct Known Subclasses:

Graphs.SynchronizedForest

Enclosing class:

Graphs

static class Graphs.SynchronizedDirectedGraph<V,E>
extends Graphs.SynchronizedAbstractGraph<V,E>
implements DirectedGraph<V,E>, Serializable

Field Summary

Fields inherited from class Graphs.SynchronizedAbstractGraph

delegate

Constructor Summary

Constructors

Modifier	Constructor	Description
private	SynchronizedDirectedGraph(DirectedGraph<V,E> delegate)

Method Summary

Modifier and Type	Method	Description
V	getDest(E directed_edge)	If directed_edge is a directed edge in this graph, returns the destination; otherwise returns null.
V	getSource(E directed_edge)	If directed_edge is a directed edge in this graph, returns the source; otherwise returns null.
boolean	isDest(V vertex, E edge)	Returns true if vertex is the destination of edge.
boolean	isSource(V vertex, E edge)	Returns true if vertex is the source of edge.

Methods inherited from class Graphs.SynchronizedAbstractGraph

addEdge, addEdge, addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getIncidentCount, getIncidentEdges, getIncidentVertices, getInEdges, getNeighborCount, getNeighbors, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSuccessorCount, getSuccessors, getVertexCount, getVertices, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, removeEdge, removeVertex

Methods inherited from class Object

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

Methods inherited from interface Graph

addEdge, addEdge, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSuccessorCount, getSuccessors, inDegree, isPredecessor, isSuccessor, outDegree

Methods inherited from interface Hypergraph

addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex

Constructor Details

SynchronizedDirectedGraph

private SynchronizedDirectedGraph(DirectedGraph<V,E> delegate)

Method Details

getDest

public V getDest(E directed_edge)

Description copied from interface: Graph

If directed_edge is a directed edge in this graph, returns the destination; otherwise returns null. The destination of a directed edge d is defined to be the vertex incident to d for which d is an incoming edge. directed_edge is guaranteed to be a directed edge if its EdgeType is DIRECTED.

Specified by:

getDest in interface Graph<V,E>

Specified by:

getDest in interface Hypergraph<V,E>

Overrides:

getDest in class Graphs.SynchronizedAbstractGraph<V,E>

Parameters:

directed_edge - the edge whose destination is to be returned

Returns:

the destination of directed_edge if it is a directed edge in this graph, or null otherwise

See Also:

• Graph.getDest(java.lang.Object)

getSource

public V getSource(E directed_edge)

Description copied from interface: Graph

If directed_edge is a directed edge in this graph, returns the source; otherwise returns null. The source of a directed edge d is defined to be the vertex for which d is an outgoing edge. directed_edge is guaranteed to be a directed edge if its EdgeType is DIRECTED.

Specified by:

getSource in interface Graph<V,E>

Specified by:

getSource in interface Hypergraph<V,E>

Overrides:

getSource in class Graphs.SynchronizedAbstractGraph<V,E>

Parameters:

directed_edge - the edge whose source is to be returned

Returns:

the source of directed_edge if it is a directed edge in this graph, or null otherwise

See Also:

• Graph.getSource(java.lang.Object)

isDest

public boolean isDest(V vertex,
 E edge)

Description copied from interface: Graph

Returns true if vertex is the destination of edge. Equivalent to getDest(edge).equals(vertex).

Specified by:

isDest in interface Graph<V,E>

Overrides:

isDest in class Graphs.SynchronizedAbstractGraph<V,E>

Parameters:

vertex - the vertex to be queried

edge - the edge to be queried

Returns:

true iff vertex is the destination of edge

See Also:

• Graph.isDest(java.lang.Object, java.lang.Object)

isSource

public boolean isSource(V vertex,
 E edge)

Description copied from interface: Graph

Returns true if vertex is the source of edge. Equivalent to getSource(edge).equals(vertex).

Specified by:

isSource in interface Graph<V,E>

Overrides:

isSource in class Graphs.SynchronizedAbstractGraph<V,E>

Parameters:

vertex - the vertex to be queried

edge - the edge to be queried

Returns:

true iff vertex is the source of edge

See Also:

• Graph.isSource(java.lang.Object, java.lang.Object)