I think it's easier to read the code: https://github.com/logicchains/LPATHBench/... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		logicchains on Dec 20, 2014 \| parent \| context \| favorite \| on: ARMv7 vs. x86-64: Pathfinding benchmark of C++, D,... I think it's easier to read the code: https://github.com/logicchains/LPATHBench/blob/master/jv.jav... Instead of a vector of node classes, there's a `static final int[][] nodes;` Which is used in a similar manner to a vector of node classes, but due to containing primitives (ints) is unboxed.

igouy on Dec 21, 2014 | [–]

When "the longest path problem" is reduced to indexed-access to an integer-sequence, does it become a duplicate of fannkuch?

http://benchmarksgame.alioth.debian.org/u64q/performance.php...

weitzj on Dec 20, 2014 | [–]

and you do not copy the bool array around as it was done in the previous version

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact