LPATHBench icon indicating copy to clipboard operation
LPATHBench copied to clipboard

Benchmarks of the longest path problem in various languages

Results 15 LPATHBench issues
Sort by recently updated
recently updated
newest added

Hello, i need to find the longest path in a graph. I've found your code and i'm trying to implement something like it on my own. But i can't make...

A few little compiler warnings cleanups and makefile improvements. I also think you should consider changing `-O2` to `-O3` as that makes the c_fast benchmark much faster when compiled with...

``` rustc rs.rs -C opt-level=3 -C no-stack-check rs.rs:24:49: 24:50 error: unexpected token: `]` rs.rs:24 unsafe { mem::transmute(self.routes[]) } ``` BTW, I had to change `--opt-level=3` to `-C opt-level=3` in makefile

Are you interested in adding a Factor (http://factorcode.org/) implementation for the benchmark? I wrote one here: https://github.com/bjourne/playground-factor/blob/master/lpath/lpath.factor

The current C++ example is unnecessarily complex and slower than a naive implementation. This patch makes the C++ example work the same way as the Nim example by using a...

I offer a version written in C for inclusion in the benchmark: https://gist.github.com/nkurz/5e49ba0ddb04e23de03f I've only tested on Haswell under Linux, but results are good when compiled with gcc-4.8 -O2: //...

I'm not really sure if I'm missing something, but why are you using `case` to pattern match on a boolean in the _Haskell_ source, when all of those ``` case...

The first version of the page I saw had a (slightly disappointing wrt. x86-64) result for OCaml-ARM which I don't see in the writeup anymore. Is it a simple omission...

I added basic pruning so recursion won't be called if the best path using the rest of unvisited nodes cannot possibly improve the current solution.