[Haskell-cafe] help with creating a DAG?

[ihope]

On 7/8/06, David Roundy <droundy at darcs.net> wrote:
> Hi all,
>
> I'm wanting to create a data structure to hold a directed acyclic
> graph (which will have patches represented by edges), and haven't yet
> been able to figure out a nice representation.  I'd like one that can
> be reasoned with recursively, or as closely to recursively as
> possible.

I don't know just what you mean by reasoning recursively, but maybe
you could use a list, where each element points to all the elements in
front of it that it's linked to.