A bidirectional edge on the graph to be searched.
It must implement Comparable so the
ISearchCallback can properly order the dependencies of a node
(so, typically, the implementations will compare the getTo()
node).
author: Felipe Leme version: $Revision: 493 $ since: Aug 25, 2005