|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface IDirectedNode<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>
Method Summary | |
---|---|
int |
getInDegree()
|
java.util.Iterator<E> |
getInEdgeIterator()
Gets all edges connecting this node |
java.util.SortedSet<E> |
getInEdgesFrom(N outNode)
|
java.util.Iterator<N> |
getInNodeIterator()
|
int |
getOutDegree()
|
java.util.Iterator<E> |
getOutEdgeIterator()
Gets all edges going out from this node. |
java.util.SortedSet<E> |
getOutEdgesTo(N inNode)
|
java.util.Iterator<N> |
getOutNodeIterator()
|
boolean |
hasInEdgeFrom(N outNode)
Has at least one edge coming into this one from outNode |
boolean |
hasOutEdgeTo(N inNode)
Has at least one edge going out from this node to inNode. |
Methods inherited from interface uk.ed.inf.graph.basic.IBasicNode |
---|
compareTo, connectedNodeIterator, edgeIterator, equals, getDegree, getEdgesWith, getGraph, getIndex, hasEdgeWith, hashCode, isRemoved |
Method Detail |
---|
int getInDegree()
int getOutDegree()
boolean hasInEdgeFrom(N outNode)
outNode
-
java.util.SortedSet<E> getInEdgesFrom(N outNode)
boolean hasOutEdgeTo(N inNode)
inNode
-
java.util.SortedSet<E> getOutEdgesTo(N inNode)
java.util.Iterator<E> getInEdgeIterator()
java.util.Iterator<E> getOutEdgeIterator()
java.util.Iterator<N> getInNodeIterator()
java.util.Iterator<N> getOutNodeIterator()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |