{"push_id":1903381361,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fb2705bd4dc4b7083e9338e4ac0e9d4f9b9d8f6b","before":"ae1b66d2b3a1ecbc4f64b2a0c044aa20e07057ac","commits":[{"sha":"fb2705bd4dc4b7083e9338e4ac0e9d4f9b9d8f6b","author":{"name":"Matheus Barba","email":"59ad38e4a855675ab6b553182eafbc4e5189612b@gmail.com"},"message":"Resolve a heuristica com um algoritmo guloso (ruim)","distinct":true,"url":"https://api.github.com/repos/mathnogueira/travelling-savelesman-problem/commits/fb2705bd4dc4b7083e9338e4ac0e9d4f9b9d8f6b"}]}
{"actor":{"display_login":"mathnogueira"}}