{"push_id":1056494345,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"adc9fea245b916b28a4250b6035db013da0add78","before":"1f44cdb3758aaf5a16fa245637c7ad49b43b5d3d","commits":[{"sha":"adc9fea245b916b28a4250b6035db013da0add78","author":{"email":"2d7320201a346d824aabd8d9a44644d69f40b6e8@gmail.com","name":"Brandon Smock"},"message":"Added a new, simplified version of Eppstein's algorithm, which can be preferable for small-to-moderate values of K, and is much easier to understand.","distinct":true,"url":"https://api.github.com/repos/bsmock/k-shortest-paths/commits/adc9fea245b916b28a4250b6035db013da0add78"}]}