When "the longest path problem" is reduced to indexed-access to an integer-sequence, does it become a duplicate of fannkuch? http://benchmarksgame.alioth.debia

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...