{"push_id":1378959902,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bb049bdeb8a947e98b2db396659fa6720d5f4652","before":"0a04164842f6e2cfa7965756b14817a08274c567","commits":[{"sha":"bb049bdeb8a947e98b2db396659fa6720d5f4652","author":{"name":"edd19","email":"0703a8cf4f42f96d7dbfb385de485373497148be@student.uclouvain.be"},"message":"create shortest path solver","distinct":true,"url":"https://api.github.com/repos/edd19/shortest_path/commits/bb049bdeb8a947e98b2db396659fa6720d5f4652"}]}
{"actor":{"display_login":"edd19"}}