4 ms·

can you explain a little further ?

• logicchains 12y ago
  I think it's easier to read the code: https://github.com/logicchains/LPATHBench/blob/master/jv.java 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.
  • weitzj 12y ago
    and you do not copy the bool array around as it was done in the previous version
  • igouy 12y ago
    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?test=fannkuchredux http://benchmarksgame.alioth.debian.org/u64q/performance.php...