|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectharpoon.Util.Collections.AbstractGraph.Node<N,E>
public static class AbstractGraph.Node<N extends AbstractGraph.Node<N,E>,E extends Graph.Edge<N,E>>
AbstractGraph.Node
provides a basic implementation of
the Graph.Node
interface.
Constructor Summary | |
---|---|
AbstractGraph.Node(AbstractGraph<N,E> parent)
|
Method Summary | |
---|---|
boolean |
isPred(N n)
Return true iff the given node is a predecessor of this node. |
boolean |
isSucc(N n)
Return true iff the given node is a successor of this node. |
Set<E> |
predC()
Return a collection of edges leading to this node. |
Set<E> |
succC()
Return a collection of edges leaving this node. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public AbstractGraph.Node(AbstractGraph<N,E> parent)
Method Detail |
---|
public Set<E> predC()
Graph.Node
predC
in interface Graph.Node<N extends AbstractGraph.Node<N,E>,E extends Graph.Edge<N,E>>
public Set<E> succC()
Graph.Node
succC
in interface Graph.Node<N extends AbstractGraph.Node<N,E>,E extends Graph.Edge<N,E>>
public boolean isSucc(N n)
Graph.Node
isSucc
in interface Graph.Node<N extends AbstractGraph.Node<N,E>,E extends Graph.Edge<N,E>>
public boolean isPred(N n)
Graph.Node
isPred
in interface Graph.Node<N extends AbstractGraph.Node<N,E>,E extends Graph.Edge<N,E>>
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |