[Haskell-cafe] Imperative graph algorithm, (tail?) recursion, and speed

Ivan Lazar Miljenovic ivan.miljenovic at gmail.com
Fri Mar 6 23:04:04 UTC 2015

On 7 March 2015 at 04:17, Jeffrey Brown <jeffbrown.the at gmail.com> wrote:
> Indeed, I did look at FGL. It's beautiful. It has a bug that does not permit
> multiedges in directed graphs, which I need.

What do you mean by "multiedges"?  Multiple edges between two nodes?
If that's the case, PatriciaTree used to have this problem, but I
fixed that way back in 2010 when I first took over maintainership of

Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com

More information about the Haskell-Cafe mailing list