Published April 3, 2017 | Version v1.0.1

bsmock/k-shortest-paths: First official major release

Authors/Creators

  • 1. University of Florida

Description

This is the first official major release of the k-shortest-paths repository. It contains implementations of three well-known algorithms (Yen, Eppstein, and Lazy Eppstein), as well as a simplified version of Eppstein's algorithm that may be useful as a starting point for learning Eppstein's algorithm.

Files

bsmock/k-shortest-paths-v1.0.1.zip

Files (287.7 kB)

Name Size
md5:5dfaa0acd1f84a82c6d5a6697754f5f5
287.7 kB Preview Download

Additional details