[Haskell-cafe] Haskell implementation of longest path algorithm
Atze van der Ploeg
atzeus at gmail.com
Sun Feb 22 10:00:31 UTC 2015
Well... I don't think anyone would consider this horrendous thing,
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:
> Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe