{"push_id":582906260,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"999c1a35657ede538d6f8bec85cd770e2acc9f0d","before":"d9d4730fea207edfc357d0e071d1d64d867532bf","commits":[{"sha":"aa70badd4aba47a76508fa9801aa3114db28d687","author":{"email":"71424b6af19d703494514285fd89d3bab32a0aa2@gmail.com","name":"franciscoy"},"message":"Basic Shortest Path based on BFS","distinct":false,"url":"https://api.github.com/repos/franciscoy/algorithms/commits/aa70badd4aba47a76508fa9801aa3114db28d687"},{"sha":"999c1a35657ede538d6f8bec85cd770e2acc9f0d","author":{"email":"1ecf5211cc700c9b0324adcef754f098af8f331b@users.noreply.github.com","name":"Francisco Yllera"},"message":"Merge pull request #12 from franciscoy/basic-shortest-path\n\nBasic Shortest Path based on BFS","distinct":true,"url":"https://api.github.com/repos/franciscoy/algorithms/commits/999c1a35657ede538d6f8bec85cd770e2acc9f0d"}]}