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

[Ivan Lazar Miljenovic]

On 7 March 2015 at 11:18, Jeffrey Brown <jeffbrown.the at gmail.com> wrote:
> Cool! I was referring to the bug declared at the top of this page [1]. Is
> that warning obsolete?
>
> [1] https://web.engr.oregonstate.edu/~erwig/fgl/haskell/

Apart from the theory that whole website is pretty much obsolete.

>
>
>
> On Fri, Mar 6, 2015 at 3:04 PM, Ivan Lazar Miljenovic
> <ivan.miljenovic at gmail.com> wrote:
>>
>> 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
>> fgl.
>>
>> --
>> Ivan Lazar Miljenovic
>> Ivan.Miljenovic at gmail.com
>> http://IvanMiljenovic.wordpress.com
>
>



-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com
http://IvanMiljenovic.wordpress.com