public class DirectedSparseGraph extends SparseGraph implements DirectedGraph
Graph
that consists of a
Vertex
set and a DirectedEdge
set.
This implementation does NOT ALLOW parallel edges.
SimpleDirectedSparseVertex
is the most efficient
vertex for this graph type.
Edge constraints imposed by this class: DIRECTED_EDGE, NOT_PARALLEL_EDGE
For additional system and user constraints defined for this class, see the superclasses of this class.
DirectedSparseVertex
,
DirectedSparseEdge
AbstractArchetypeGraph.Requirements
UserDataContainer.CopyAction
mEdges, mVertices
edge_requirements, mEdgeIDs, mGraphListenerHandler, mVertexIDs, vertex_requirements
factory, udc_delegate
DIRECTED_EDGE, NOT_PARALLEL_EDGE, SIMPLE_EDGE, UNDIRECTED_EDGE
SUBSET_MANAGER
Constructor and Description |
---|
DirectedSparseGraph()
Creates an instance of a sparse directed graph.
|
addEdge, addVertex, getEdges, getVertices, initialize, isDirected, removeEdge, removeEdges, removeVertex, removeVertices
addAllNotInitializers, addListener, checkConstraints, copy, getEdgeConstraints, getVertexConstraints, listenersExist, newInstance, numEdges, numVertices, removeAllEdges, removeAllVertices, removeListener, toString
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDataFactory, setUserDatum
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
addEdge, addVertex, isDirected, removeEdge, removeVertex
addListener, copy, getEdgeConstraints, getEdges, getVertexConstraints, getVertices, newInstance, numEdges, numVertices, removeAllEdges, removeAllVertices, removeEdges, removeListener, removeVertices
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum