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

java.lang.Object
  edu.uci.ics.jung.utils.UserData
      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, java.lang.Cloneable, UserDataContainer, Vertex

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 inherited from class edu.uci.ics.jung.utils.UserDataContainer

UserDataContainer.CopyAction

Field Summary

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

CLONE, REMOVE, SHARED

Constructor Summary

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

Method Summary

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.
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.

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

getPredecessors, getSuccessors, inDegree, isDest, isPredecessorOf, isSource, isSuccessorOf, numPredecessors, numSuccessors, outDegree

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

copy, degree, equals, getEqualVertex, getEquivalentVertex, getGraph, getIncidentEdges, getNeighbors, hashCode, isIncident, isNeighborOf, numNeighbors, toString

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

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

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

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

addUserDatum, 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

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

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)