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, mSuccsToOutEdges
id, m_Graph
factory, 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_internal
getNeighbors_internal, getPredecessors, getSuccessors, inDegree, initialize, isDest, isPredecessorOf, isSource, isSuccessorOf, numPredecessors, numSuccessors, outDegree, setNeighborsToEdges, setPredsToInEdges, setSuccsToOutEdges
copy, findEdge, findEdgeSet, toString
degree, equals, getEqualVertex, getEquivalentVertex, getIncidentEdges, getIncidentElements, getNeighbors, isIncident, isNeighborOf, numNeighbors
addGraph_internal, getGraph, hashCode, removeGraph_internal
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDataFactory, setUserDatum
finalize, getClass, notify, notifyAll, wait, wait, wait
findEdge, findEdgeSet, getInEdges, getOutEdges, getPredecessors, getSuccessors, inDegree, isDest, isPredecessorOf, isSource, isSuccessorOf, numPredecessors, numSuccessors, outDegree
copy, degree, findEdge, findEdgeSet, getEqualVertex, getEquivalentVertex, getIncidentEdges, getNeighbors, isIncident, isNeighborOf, numNeighbors
getGraph, getIncidentElements
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum
public 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 SimpleSparseVertex
protected java.util.Map getSuccsToOutEdges()
getSuccsToOutEdges
in class SimpleSparseVertex
protected java.util.Map getPredsToInEdges()
SimpleSparseVertex
getPredsToInEdges
in class SimpleSparseVertex
public void readVertexAnnotation()
public void readVertexData()
protected void addNeighbor_internal(Edge e, Vertex v)
AbstractSparseVertex
e
and vertex v
to the internal data structures of this vertex.addNeighbor_internal
in class SparseVertex
e
- the new incident edge of this vertexv
- the new neighbor of this vertexAbstractSparseVertex.addNeighbor_internal(Edge, Vertex)
public java.lang.Object getUniqueID()