{"push_id":2500789061,"size":1,"distinct_size":1,"ref":"refs/heads/HW-1","head":"6548a2d56a73278bdcac1460df0432142f8571a3","before":"c8f5b94af0df406a04a9048fd13911cb7d3b9254","commits":[{"sha":"6548a2d56a73278bdcac1460df0432142f8571a3","author":{"name":"jonesjonathan","email":"8a8b2bb02f77e47ec14408bc911369fdc2d65f90@oregonstate.edu"},"message":"Implemented A* Search (astar)\n\nThe function astar uses a priority queue, a heuristic and a bfs search to decrease the amount of expanded nodes in the search.","distinct":true,"url":"https://api.github.com/repos/Brallen/CS331/commits/6548a2d56a73278bdcac1460df0432142f8571a3"}]}
{"actor":{"display_login":"jonesjonathan"}}