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,
DirectedSparseEdgeAbstractArchetypeGraph.RequirementsUserDataContainer.CopyActionmEdges, mVerticesedge_requirements, mEdgeIDs, mGraphListenerHandler, mVertexIDs, vertex_requirementsfactory, udc_delegateDIRECTED_EDGE, NOT_PARALLEL_EDGE, SIMPLE_EDGE, UNDIRECTED_EDGESUBSET_MANAGER| Constructor and Description |
|---|
DirectedSparseGraph()
Creates an instance of a sparse directed graph.
|
addEdge, addVertex, getEdges, getVertices, initialize, isDirected, removeEdge, removeEdges, removeVertex, removeVerticesaddAllNotInitializers, addListener, checkConstraints, copy, getEdgeConstraints, getVertexConstraints, listenersExist, newInstance, numEdges, numVertices, removeAllEdges, removeAllVertices, removeListener, toStringaddUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDataFactory, setUserDatumequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitaddEdge, addVertex, isDirected, removeEdge, removeVertexaddListener, copy, getEdgeConstraints, getEdges, getVertexConstraints, getVertices, newInstance, numEdges, numVertices, removeAllEdges, removeAllVertices, removeEdges, removeListener, removeVerticesaddUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum