Some of us on #haskell last night (well, night for me :p) were
discussing this, and we're going to start a new project to implement an
extended version of my proposal. The working project name is simply
graph (hey, we couldn't think of anything better!). If you want to
join in the fun, talk to
At the moment, there are at least three ways people use graph
data-structures in Haskell:
* Data.Graph from containers
* Data.Graph.Inductive from FGL
* A custom job (usually using something like IntMap).
If we look on Hackage, there are a number of graph-related packages
there,
On Wed, Jun 24, 2009 at 3:21 AM, Ivan Lazar
Miljenovicivan.miljeno...@gmail.com wrote:
there, each of which uses one of the above approaches. However, for the
more generic packages that operate _on_ graphs (rather than using
graphs as an internal data structure),
...
I thus propose that we
Yay, someone read my proposal! :p
2009/6/25 Andrew Hunter andrewhhun...@gmail.com:
This is a good idea and one I support. (I think I've been told before
that this has been tried w/o a lot of success, but, well...) My
primary concern is this: you built your class for things that operate
on
