Adds an edge to the in adjacency list of the node which is an
underlying List implementation. No checking is done on the edge
(duplication, looping...), it is simply added to the list. It is also
assumed that the edge being added has the node as its out node.
See Also:DirectedNode.addIn(DirectedEdge) See Also: See Also:DirectedEdge.getOutNode
Adds an edge to the ou adjacency list of the node which is an
underlying List implementation. No checking is done on the edge
(duplication, looping...), it is simply added to the list. It is also
assumed that the edge being added has the node as its in node.
See Also:DirectedNode.addOut(DirectedEdge) See Also: See Also:DirectedEdge.getInNode
First searches for an in edge with an out node == this, and in
node == other. If none is found an edge with out node == other, and in
node == this is searched for.
See Also:Node.remove(Edge)