{"push_id":979029165,"size":1,"distinct_size":1,"ref":"refs/heads/breadth-first-search","head":"19e0fc7cf6be4444ee8793b0b6dca6924922c191","before":"1a96dc028b3c88226f504a5a58a9c7f41980993b","commits":[{"sha":"19e0fc7cf6be4444ee8793b0b6dca6924922c191","author":{"email":"2d55f3ee126612cabcb798a2c7b7d960d2586315@gmail.com","name":"Chris Pilcher"},"message":"BFS. Fixing infinite loop when graph contains cycles (by recording seen nodes). Added draft shortest path algorithm.","distinct":true,"url":"https://api.github.com/repos/chris-pilcher/swift-algorithm-club/commits/19e0fc7cf6be4444ee8793b0b6dca6924922c191"}]}