{"push_id":670931724,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"910731f2b788c107ccbe54259dd447d6146e40db","before":"2f9c57e352d30d6953c331a3c9c8bf0260766e9b","commits":[{"sha":"910731f2b788c107ccbe54259dd447d6146e40db","author":{"email":"ce093311b839b2023758d9c0d1967d2fd2453fb5@gmail.com","name":"Spyridon Kazanas"},"message":"21-05-2015: At this point a k shortest path that finds all paths (not\nonly loopless paths) is needed. We could use a drop in replacement of\nYenksp but since we couldn't find a python implementation we are going\nto follow a different approach in the next version.","distinct":true,"url":"https://api.github.com/repos/SWRG/ESWC2015-paper-evaluation/commits/910731f2b788c107ccbe54259dd447d6146e40db"}]}