[Lemon-user] EdgeLookup for SmartGraph

[Alpár Jüttner]

On Fri, 2009-05-22 at 19:21 -0400, Goldberg, Noam wrote:
> There is an object called ArcLookUp which is seems to be really used to
>  implement the one simple procedure of finding an Arc of a directed
>  graph by its endpoints.

In fact, it is a bit more than that. It finds an Arc between two nodes
(u,v) in O(log d) steps (d is the number of outgoing arcs of u), which
can be much faster than a simple linear search, especially for dense
graph.

Regards,
Alpar