{"push_id":2894580686,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"58a2a3658cd0cc229822950c785c3f7a6617e9e8","before":"9ef1a7dc28d5d54a0c6e5b8ba1638abcfbeb4471","commits":[{"sha":"58a2a3658cd0cc229822950c785c3f7a6617e9e8","author":{"name":"Natalia Kaczor","email":"66eccf0c3d2f6257da18a5f1d35154f457ecf330@gmail.com"},"message":"Finding the shortest path using A* algorithm","distinct":true,"url":"https://api.github.com/repos/nkaczor/pacman-reinforcement/commits/58a2a3658cd0cc229822950c785c3f7a6617e9e8"}]}
{"actor":{"display_login":"nkaczor"}}