public class LazySparseVertex extends SparseVertex implements Vertex
UserDataContainer.CopyAction| Modifier and Type | Field and Description |
|---|---|
protected java.lang.String |
current_status |
static java.lang.String |
STATUS_COMPLETE |
static java.lang.String |
STATUS_NAME_KNOWN_BUT_EMPTY |
static java.lang.String |
STATUS_READ_BUT_NOT_NEIGHBORS |
mNeighborsToEdges, mPredsToInEdges, mSuccsToOutEdgesid, m_Graphfactory, udc_delegate| Constructor and Description |
|---|
LazySparseVertex(java.lang.Object uniqueID,
LazySparseVertexFactory lsvf) |
| 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. |
protected java.util.Map |
getNeighborsToEdges()
Returns a map from the successors of this vertex to its outgoing edges.
|
protected java.util.Map |
getPredsToInEdges()
Returns a map from the predecessors of this vertex to its incoming
edges.
|
protected java.util.Map |
getSuccsToOutEdges()
Returns a map from the successors of this vertex to its outgoing edges.
|
java.lang.Object |
getUniqueID() |
void |
readVertexAnnotation() |
void |
readVertexData() |
findEdge, findEdgeSet, getEdges_internal, getInEdges, getOutEdges, removeNeighbor_internalgetNeighbors_internal, getPredecessors, getSuccessors, inDegree, initialize, isDest, isPredecessorOf, isSource, isSuccessorOf, numPredecessors, numSuccessors, outDegree, setNeighborsToEdges, setPredsToInEdges, setSuccsToOutEdgescopy, findEdge, findEdgeSet, toStringdegree, equals, getEqualVertex, getEquivalentVertex, getIncidentEdges, getIncidentElements, getNeighbors, isIncident, isNeighborOf, numNeighborsaddGraph_internal, getGraph, hashCode, removeGraph_internaladdUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDataFactory, setUserDatumfinalize, getClass, notify, notifyAll, wait, wait, waitfindEdge, findEdgeSet, getInEdges, getOutEdges, getPredecessors, getSuccessors, inDegree, isDest, isPredecessorOf, isSource, isSuccessorOf, numPredecessors, numSuccessors, outDegreecopy, degree, findEdge, findEdgeSet, getEqualVertex, getEquivalentVertex, getIncidentEdges, getNeighbors, isIncident, isNeighborOf, numNeighborsgetGraph, getIncidentElementsaddUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatumpublic static final java.lang.String STATUS_NAME_KNOWN_BUT_EMPTY
public static final java.lang.String STATUS_READ_BUT_NOT_NEIGHBORS
public static final java.lang.String STATUS_COMPLETE
protected java.lang.String current_status
public LazySparseVertex(java.lang.Object uniqueID,
LazySparseVertexFactory lsvf)
protected java.util.Map getNeighborsToEdges()
getNeighborsToEdges in class SimpleSparseVertexprotected java.util.Map getSuccsToOutEdges()
getSuccsToOutEdges in class SimpleSparseVertexprotected java.util.Map getPredsToInEdges()
SimpleSparseVertexgetPredsToInEdges in class SimpleSparseVertexpublic void readVertexAnnotation()
public void readVertexData()
protected void addNeighbor_internal(Edge e, Vertex v)
AbstractSparseVertexe and vertex v
to the internal data structures of this vertex.addNeighbor_internal in class SparseVertexe - the new incident edge of this vertexv - the new neighbor of this vertexAbstractSparseVertex.addNeighbor_internal(Edge, Vertex)public java.lang.Object getUniqueID()