[Haskell-cafe] Haskell implementation of longest path algorithm

[Jyotirmoy Bhattacharya]

On Sun, Feb 22, 2015 at 3:04 PM, Jeremy <voldermort at hotmail.com> wrote:

> Compared to the Nim code
> [https://github.com/logicchains/LPATHBench/blob/master/nim.nim] for a
> longest path algorithm, Haskell
> [https://github.com/logicchains/LPATHBench/blob/master/hs.hs] looks
> horrendously verbose and ugly, even if you ignore the pragmas and imports.
>
> Is this idiomatic Haskell style? Could it be clearer, but has to be written
> that way for performance - although it still takes 3.7x as long as the Nim
> version [https://github.com/logicchains/LPATHBench/blob/master/writeup.md
> ]?
>
> A clearer version
http://lpaste.net/120981
though this is 2x-3x slower than the Haskell version above.

Regards,
Jyotirmoy Bhattacharya
http://www.jyotirmoy.net
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150222/a0a78705/attachment.html>