I was looking around and liked some of the ways that Boost organizes
its libraries. So it got me thinking that it might be easy to use the
same for a Haskell graph library. This IS NOT FGL, but does include
some elements of it at the end (InductiveGraph).
Mostly what I like, is that it presents
On Tue, Sep 14, 2010 at 2:12 PM, Thomas Bereknyei tombe...@gmail.com wrote:
--TODO: Visitors? DFF searches
I don't feel qualified to comment on much in your email, but this todo
gave me pause:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg60468.html
I think you might have a
