public interface DirectedEdge extends Edge
Edge
which imposes an ordering on its incident
vertices. A directed edge e
is an ordered pair of
vertices <v1, v2>
which connects its source,
v1
, to its destination, v2
.
Equivalently, e
is an outgoing edge of v1
and an incoming edge of v2
.DirectedGraph
,
UndirectedEdge
,
Vertex
UserDataContainer.CopyAction
Modifier and Type | Method and Description |
---|---|
Vertex |
getDest()
Returns the destination of this directed edge.
|
Vertex |
getSource()
Returns the source of this directed edge.
|
getEndpoints, getOpposite
copy, getEqualEdge, getEquivalentEdge, getIncidentVertices, isIncident, numVertices
getGraph, getIncidentElements
addUserDatum, clone, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum
Vertex getSource()
Vertex.isSource(Edge)
Vertex getDest()
Vertex.isDest(Edge)