{"push_id":644139522,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a030a3c5c273942e452b13846d8de5c55353e359","before":"a0df0b4ecdfd5650088c04ec25b5fc050b9a21b7","commits":[{"sha":"a030a3c5c273942e452b13846d8de5c55353e359","author":{"email":"77b908fad97b51726e14a6f47e7ae32eda83cb88@gmail.com","name":"mehrotramudit"},"message":"Dijkstra shortest path algorithm","distinct":true,"url":"https://api.github.com/repos/mehrotramudit/Kronos/commits/a030a3c5c273942e452b13846d8de5c55353e359"}]}