[Haskell-cafe] OT: representations for graphs

Nathan Bloomfield nbloomf at gmail.com
Fri Dec 19 13:39:29 EST 2008

(Forgot to send to haskell-cafe- sorry Alistair!)

Martin Erwig wrote a paper [1] that defines an inductive graph type and
implements some common algorithms with it.

Also, it isn't very Haskellish but if you can label your nodes with an
instance of Ix you might be able to use an Array to get constant time
I've never used Data.HashTable before, but that might also be useful.

[1] -
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20081219/7931ef45/attachment.htm

More information about the Haskell-Cafe mailing list