java.lang.Object | ||
↳ | com.microstrategy.utils.DAG.AnnotatableObject | |
↳ | com.microstrategy.utils.DAG.Vertex |
This class represents an end point ("vertex") in a Directed Acyclic Graph. Each vertex must have a unique key which is used to identify that vertex in the graph. Each Vertex manages a set of "incoming" edges (those edges that have this Vertex as a "to" end) and a set of "outgoing" edges (those edges that have this Vertex as a "from" end). A Vertex is an "annotatable" object which means that callers may set properties on this object. It is the caller's responsibility to ensure that it uses property names which are unique.
Public Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
int |
getIncomingEdgeCount()
Returns the number of incoming edges to this Vertex.
| ||||||||||
Iterator<DAG.Edge> |
getIncomingEdges()
Returns the incoming edges to this Vertex.
| ||||||||||
String |
getKey()
Returns the key associated with this Vertex.
| ||||||||||
int |
getOutgingEdgeCount()
Returns the number of outgoing edges from this Vertex.
| ||||||||||
Iterator<DAG.Edge> |
getOutgoingEdges()
Returns the outgoing edges from this Vertex.
|
[Expand]
Inherited Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
![]() | |||||||||||
![]() |
Returns the number of incoming edges to this Vertex.
Returns the incoming edges to this Vertex.
Returns the key associated with this Vertex.
Returns the number of outgoing edges from this Vertex.
Returns the outgoing edges from this Vertex.