{"push_id":814988240,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"0e9b4966e2faecf627c12ccdbda867c8777a4cef","before":"e338de61ae303ab011498478e8dde223e10b2ecf","commits":[{"sha":"bcf6606cd3ce9b19624d5e7cd996b7969070ddeb","author":{"email":"50a57743a33397a0673a6f4213158e8ad88e6412@hotmail.com","name":"Rajat Pawar"},"message":"add kruskal’s algorithm to generate a minimum spanning tree","distinct":true,"url":"https://api.github.com/repos/rajatIIT/graph_algo_practice/commits/bcf6606cd3ce9b19624d5e7cd996b7969070ddeb"},{"sha":"0e9b4966e2faecf627c12ccdbda867c8777a4cef","author":{"email":"50a57743a33397a0673a6f4213158e8ad88e6412@hotmail.com","name":"Rajat Pawar"},"message":"add create random graph","distinct":true,"url":"https://api.github.com/repos/rajatIIT/graph_algo_practice/commits/0e9b4966e2faecf627c12ccdbda867c8777a4cef"}]}