edu.uci.ics.jung.graph.impl

Class DirectedSparseVertex

java.lang.Object

edu.uci.ics.jung.utils.UserDataDelegate

edu.uci.ics.jung.graph.impl.AbstractElement

edu.uci.ics.jung.graph.impl.AbstractArchetypeVertex

edu.uci.ics.jung.graph.impl.AbstractSparseVertex

edu.uci.ics.jung.graph.impl.SimpleDirectedSparseVertex

edu.uci.ics.jung.graph.impl.DirectedSparseVertex

All Implemented Interfaces:

ArchetypeVertex, Element, Vertex, UserDataContainer, java.lang.Cloneable

public class DirectedSparseVertex
extends SimpleDirectedSparseVertex

A vertex class that supports directed edges (but not undirected edges) and allows parallel edges. UndirectedGraph

Author:

Joshua O'Madadhain

Nested Class Summary

Nested classes/interfaces inherited from interface edu.uci.ics.jung.utils.UserDataContainer

UserDataContainer.CopyAction

Field Summary

Fields inherited from class edu.uci.ics.jung.graph.impl.AbstractElement

id, m_Graph

Fields inherited from class edu.uci.ics.jung.utils.UserDataDelegate

factory, udc_delegate

Constructor Summary

Constructors

Constructor and Description
DirectedSparseVertex() Creates a new instance of a vertex for inclusion in a sparse graph.

Method Summary

Methods

Modifier and Type	Method and Description
protected void	addNeighbor_internal(Edge e, Vertex v) Adds the specified edge e and vertex v to the internal data structures of this vertex.
Edge	findEdge(Vertex v) Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge.
java.util.Set	findEdgeSet(Vertex v) Returns the set of edges that connect this vertex to the specified vertex.
protected java.util.Collection	getEdges_internal() Returns a list of all incident edges of this vertex.
java.util.Set	getInEdges() Returns the set of incoming edges of this vertex.
java.util.Set	getOutEdges() Returns the set of outgoing edges of this vertex.
protected void	removeNeighbor_internal(Edge e, Vertex v) Removes the specified edge e and vertex v from the internal data structures of this vertex.

Methods inherited from class edu.uci.ics.jung.graph.impl.SimpleDirectedSparseVertex

getNeighbors_internal, getPredecessors, getPredsToInEdges, getSuccessors, getSuccsToOutEdges, inDegree, initialize, isDest, isPredecessorOf, isSource, isSuccessorOf, numPredecessors, numSuccessors, outDegree, setPredsToInEdges, setSuccsToOutEdges

Methods inherited from class edu.uci.ics.jung.graph.impl.AbstractSparseVertex

copy, findEdge, findEdgeSet, toString

Methods inherited from class edu.uci.ics.jung.graph.impl.AbstractArchetypeVertex

degree, equals, getEqualVertex, getEquivalentVertex, getIncidentEdges, getIncidentElements, getNeighbors, isIncident, isNeighborOf, numNeighbors

Methods inherited from class edu.uci.ics.jung.graph.impl.AbstractElement

addGraph_internal, getGraph, hashCode, removeGraph_internal

Methods inherited from class edu.uci.ics.jung.utils.UserDataDelegate

addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDataFactory, setUserDatum

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

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

degree, getEqualVertex, getEquivalentVertex, getIncidentEdges, getNeighbors, isIncident, isNeighborOf, numNeighbors

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

getGraph, getIncidentElements

Methods inherited from interface edu.uci.ics.jung.utils.UserDataContainer

addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum

Constructor Detail

DirectedSparseVertex

public DirectedSparseVertex()

Creates a new instance of a vertex for inclusion in a sparse graph.

Method Detail

getInEdges

public java.util.Set getInEdges()

Description copied from interface: Vertex

Returns the set of incoming edges of this vertex. An edge e is an incoming edge of this vertex if and only if this.isDest(e) returns true. Each element of the set returned should implement Edge.

Specified by:

getInEdges in interface Vertex

Overrides:

getInEdges in class SimpleDirectedSparseVertex

Returns:

all edges whose destination is this vertex

See Also:

Vertex.getInEdges()

getOutEdges

public java.util.Set getOutEdges()

Description copied from interface: Vertex

Returns the set of outgoing edges of this vertex. An edge e is an outgoing edge of this vertex if and only if this.isSource(e) returns true. Each element of the set returned should implement Edge.

Specified by:

getOutEdges in interface Vertex

Overrides:

getOutEdges in class SimpleDirectedSparseVertex

Returns:

all edges whose source is this vertex

See Also:

Vertex.getOutEdges()

findEdge

public Edge findEdge(Vertex v)

Returns the edge that connects this vertex to the specified vertex v, or null if there is no such edge. Implemented using a hash table for a performance improvement over the implementation in AbstractSparseVertex. Looks for a directed edge first, and then for an undirected edge if no directed edges are found.

Specified by:

findEdge in interface Vertex

Overrides:

findEdge in class SimpleDirectedSparseVertex

See Also:

Vertex.findEdge(Vertex)

findEdgeSet

public java.util.Set findEdgeSet(Vertex v)

Description copied from class: SimpleDirectedSparseVertex

Returns the set of edges that connect this vertex to the specified vertex. Since this implementation does not allow for parallel edges, this implementation simply returns a set whose contents consist of the return value from findEdge(v).

Specified by:

findEdgeSet in interface Vertex

Overrides:

findEdgeSet in class SimpleDirectedSparseVertex

See Also:

Vertex.findEdgeSet(Vertex)

getEdges_internal

protected java.util.Collection getEdges_internal()

Returns a list of all incident edges of this vertex. Requires time proportional to the number of incident edges.

Overrides:

getEdges_internal in class SimpleDirectedSparseVertex

See Also:

AbstractArchetypeVertex.getEdges_internal()

addNeighbor_internal

protected void addNeighbor_internal(Edge e,
                        Vertex v)

Description copied from class: AbstractSparseVertex

Adds the specified edge e and vertex v to the internal data structures of this vertex.

Overrides:

addNeighbor_internal in class SimpleDirectedSparseVertex

Parameters:

e - the new incident edge of this vertex

v - the new neighbor of this vertex

See Also:

AbstractSparseVertex.addNeighbor_internal(Edge, Vertex)

removeNeighbor_internal

protected void removeNeighbor_internal(Edge e,
                           Vertex v)

Description copied from class: AbstractSparseVertex

Removes the specified edge e and vertex v from the internal data structures of this vertex.

Overrides:

removeNeighbor_internal in class SimpleDirectedSparseVertex

Parameters:

e - the incident edge of this vertex which is being removed

v - the neighbor of this vertex which is being removed

See Also:

AbstractSparseVertex.removeNeighbor_internal(Edge, Vertex)