|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface IDirectedPair<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>
Method Summary | |
---|---|
N |
getInNode()
Get the node to which the end goes into. |
N |
getOutNode()
Get the node to which the end comes from. |
boolean |
hasDirectedEnds(N outNode,
N inNode)
Tests if the ends exist in this directed pair. |
IDirectedPair<N,E> |
reversedNodes()
Create a new node pair, with the nodes reversed as if this edge was pointing in the other direction. |
Methods inherited from interface uk.ed.inf.graph.basic.IBasicPair |
---|
containsNode, equals, getOtherNode, hasEnds, hashCode |
Method Detail |
---|
boolean hasDirectedEnds(N outNode, N inNode)
hasDirectedEnds(outNode, inNode) != hasDirectedEnds(inNode, outNode)
.
outNode
- the out node (from which the edge leaves).inNode
- the in node (to which the edge goes to).
N getInNode()
N getOutNode()
IDirectedPair<N,E> reversedNodes()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |