N
- The type of Node stored in this GraphET
- The type of Edge stored in this Graphpublic interface DirectionalGraph<N,ET extends DirectionalEdge<N>> extends Graph<N,ET>
Modifier and Type | Method and Description |
---|---|
java.util.List<ET> |
getInwardEdgeList(N node)
Returns a List of the Edges for which the given Node is a sink Node in
this DirectionalGraph.
|
java.util.List<ET> |
getOutwardEdgeList(N node)
Returns a List of the Edges for which the given Node is a source Node in
this DirectionalGraph.
|
boolean |
hasInwardEdge(N node)
Returns true if the given Node is connected to any Edge in this
DirectionalGraph as a sink Node.
|
boolean |
hasOutwardEdge(N node)
Returns true if the given Node is connected to any Edge in this
DirectionalGraph as a source Node.
|
addEdge, addGraphChangeListener, addNode, clear, containsEdge, containsNode, equals, getAdjacentEdges, getEdgeList, getGraphChangeListeners, getNodeCount, getNodeList, hashCode, isEmpty, removeEdge, removeGraphChangeListener, removeNode
java.util.List<ET> getInwardEdgeList(N node)
node
- The Node for which to return the inward Edges.java.util.List<ET> getOutwardEdgeList(N node)
node
- The Node for which to return the outward Edges.boolean hasInwardEdge(N node)
node
- The Node for which to check for inward Edges.boolean hasOutwardEdge(N node)
node
- The Node for which to check for outward Edges.