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

On 7 March 2015 at 04:17, Jeffrey Brown 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 fgl. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com http://IvanMiljenovic.wordpress.com