Haskell implementation of longest path algorithm
19 Feb
2015
19 Feb
'15
8:56 a.m.
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]?
4111
Age (days ago)
4111
Last active (days ago)
0 comments
1 participants
participants (1)
-
Jeremy