Parallel solution to Taxi Path Problem (RuiDiao)

The included code and white paper provides a parallel solution for enumerating Delannoy paths visualized as paths of a taxi through a grid of city streets. A divide and conquer algorithm is used to recursively build paths. The symmetric property of enumerated routes is used to conserve computation time and storage space. Parallelism is achieved using Intel Cilk Plus.

DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.

There are downloads available under the Creative Commons License license. Download Now

Include in RSS: 

For more complete information about compiler optimizations, see our Optimization Notice.