{"push_id":1438296476,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"623c4a0e27dcbd68ab7a2a49dfa8fb9b93956a6b","before":"a165c480ad39d8b5eb64579635d8d5ff0a1d573f","commits":[{"sha":"623c4a0e27dcbd68ab7a2a49dfa8fb9b93956a6b","author":{"name":"hmoenk","email":"bee9b6cbc89592307f9afa7c751810c47529232d@moenkeberg.ch"},"message":"Analysing dataset and get shortest path in leaflet","distinct":true,"url":"https://api.github.com/repos/davidhanimann/Networking/commits/623c4a0e27dcbd68ab7a2a49dfa8fb9b93956a6b"}]}
{"actor":{"display_login":"hmoenk"}}