{"push_id":561657197,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"59634ecf60dafa1758726dd17767da593ca96f29","before":"aecc429b79af8b1b081b3d1013f16918066db7a9","commits":[{"sha":"e58490292775171a68efb7881aacc7fa952a72b0","author":{"email":"7c279cf8ffb2eefb572758306726cba3e7c61b00@gmail.com","name":"Bocharov Alexandr"},"message":"Princeton - adding quick find union algorithm implementation O(n)","distinct":true,"url":"https://api.github.com/repos/bocharov/algorithms/commits/e58490292775171a68efb7881aacc7fa952a72b0"},{"sha":"59634ecf60dafa1758726dd17767da593ca96f29","author":{"email":"7c279cf8ffb2eefb572758306726cba3e7c61b00@gmail.com","name":"Bocharov Alexandr"},"message":"Princeton - add weighted quick union algorithm implementation, add theory pdf.","distinct":true,"url":"https://api.github.com/repos/bocharov/algorithms/commits/59634ecf60dafa1758726dd17767da593ca96f29"}]}