de.aitools.aq.structure.graph
Interface UndirectedIntGraph.Edge

A possible edge connecting two vertices of an underlying
UndirectedIntGraph. The edge denoted by this object must not
necessarily exist in the graph -- use exists() to check.

This is a convenience object mainly used for iterators, which can return
it as a tuple of two vertices. To avoid creating a huge amount of
objects, implementors are encouraged to let iterators always return
the same edge on a call to iterator.next(), but with updated
vertices. Note that this means that a user has to use
edge.clone()
if he wants an edge independent of the iterator.

The methods should simply call the appropriate methods of the
underlying graph.