{"push_id":848361985,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f399742a4661cfd134b3b182390557f030b8b968","before":"7d3bfd1d7e5839a84993afd9b67b01ad610014d7","commits":[{"sha":"f399742a4661cfd134b3b182390557f030b8b968","author":{"email":"3099476fc301273b58bc7161ff55ab6af4e704ab@gmail.com","name":"amukherj"},"message":"1. Fixed bugs in disjoint_sets ADT.\n2. Fixed bugs in adjacency_list implementation.\n3. Added a temporary implementation of Kruska's Minimum Spanning Tree\nAlgorithm in the test code. To be factored out later.","distinct":true,"url":"https://api.github.com/repos/amukherj/asterisks/commits/f399742a4661cfd134b3b182390557f030b8b968"}]}