anyone out there know of a graph library that doesn't use a hash in the impl,
thereby restricting only one edge from u -->> v?  i've used rgl extensively in
the past but it uses a hash under the hood and has this restriction.

i'm coding a FSM class so i need to be able to have multiple labeled edges
from u -->> v.

regards.

-a
-- 
suffering increases your inner strength.  also, the wishing for suffering
makes the suffering disappear.
- h.h. the 14th dali lama