Representing cyclic data structures efficiently in Haskell

andrew cooke
Sat, 12 Jul 2003 13:08:07 -0400

Sarah Thompson <> writes:
> work that well for circuits because, for anything other than trivially
> simple components, the connections between nodes need to be labelled.

it's been a while since i used it, but i thought erwig's graph library
had labels on edges.  it's a really sweet piece of work (disclaimer: i
used the ml version).