Represents a node in a directed graph. A directed node differentiates
between adjacent edges that start at the node and those adjacent edges that
terminate at the node. The former are referred to as "in" edges, and
the latter "out" edges.
See Also:DirectedGraph author: Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net
Method Summary
public void
addIn(DirectedEdge e) Adds an edge to the in adjacency list of the node.
public void
addOut(DirectedEdge e) Adds an edge to the out adjacency list of the node.
Returns an edge that terminates at the node and originates from a
specified node.
Note: It is possible for two nodes to share multiple edges between them. In
this case, getInEdges(Node other) can be used to obtain a complete list.
Parameters: other - The originating node. The first edge found to terminate at the node and originate from the specefied node. See Also:Node.getEdge(Node)
Returns all edges that terminate at the node and originate from a
specified node.
Parameters: other - The originating node. All edges found to terminate at the node and originate from thespecified node. See Also:Node.getEdges(Node)
Returns an edge that originates at the node and terminates at a
specified node.
Note: It is possible for two nodes to share multiple edges between them. In
this case, getOutEdges(Node other) can be used to obtain a complete list.
Parameters: other - The terminating node. The first edge found to originate at the node and terminate at the specefied node. See Also:Node.getEdge(Node)
Returns all edges that originate at the node and terminate from at
specified node.
Parameters: other - The temimnating node. All edges found to originate at the node and terminate at thespecified node. See Also:Node.getEdges(Node)