{"push_id":597872095,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c160810a2d2a134b8c6325be083e19d6ce0106e0","before":"6599bc91b0c8d5356420ec5d16d5d3a4dd1e8982","commits":[{"sha":"c160810a2d2a134b8c6325be083e19d6ce0106e0","author":{"email":"e2098bc95d7ba7d6830d3818e396efb1a488f4e3@ivc.edu","name":"Austin Vaday"},"message":"Shortest path works WITH total distance computed","distinct":true,"url":"https://api.github.com/repos/AustinVaday/CS1D-Class-Project-1/commits/c160810a2d2a134b8c6325be083e19d6ce0106e0"}]}