{"push_id":1199831688,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ccb9c2d5ebf886e572b0e159f3c1858cf5f54941","before":"63df6674643d4d4327f7801fa5b2dadeff99ffbb","commits":[{"sha":"ccb9c2d5ebf886e572b0e159f3c1858cf5f54941","author":{"name":"iamharshit","email":"fe75dbd36775b0224e0b152675b592da600b1b71@gmail.com"},"message":"Implementation of Dijkstra algorithm used for finding shortest path from a node to all other nodes","distinct":true,"url":"https://api.github.com/repos/iamharshit/my_Algorithm_implementations/commits/ccb9c2d5ebf886e572b0e159f3c1858cf5f54941"}]}
{"actor":{"display_login":"iamharshit"}}