[Haskell-cafe] Haskell implementation of longest path algorithm

[Atze van der Ploeg]

Well... I don't think anyone would consider this horrendous thing,
idiomatic haskell...

2015-02-22 10:34 GMT+01:00 Jeremy <voldermort at hotmail.com>:

> 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
> ]?
>
> I posted this to the beginners group last week, but no reply, so trying
> again here.
>
>
>
> --
> View this message in context:
> http://haskell.1045720.n5.nabble.com/Haskell-implementation-of-longest-path-algorithm-tp5765786.html
> Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150222/41492471/attachment.html>