{"push_id":1232841198,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"dd43084b8d63dc8b8abc42b88ddfc5780c5a0cb0","before":"15d044e9666f60fcf65efb5140f0d5e3a5c13400","commits":[{"sha":"dd43084b8d63dc8b8abc42b88ddfc5780c5a0cb0","author":{"name":"Lyapunov","email":"8e007909265e120f8ff166b81cf45c38072f40ce@gmail.com"},"message":"Demonstrating the union by rank with path compression.","distinct":true,"url":"https://api.github.com/repos/Lyapunov/algorithm-design-analysis-coursera/commits/dd43084b8d63dc8b8abc42b88ddfc5780c5a0cb0"}]}
{"actor":{"display_login":"Lyapunov"}}