{"push_id":730417421,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d38d234e845ae34ecf2c085246dcac68ee02ac46","before":"6e9c844de7ee643700c4d863568659a1848ca577","commits":[{"sha":"d38d234e845ae34ecf2c085246dcac68ee02ac46","author":{"email":"bf04723062b30ae8a94efc7a34cfac0f84180cc0@gmail.com","name":"Lex Muga"},"message":"Leaf Number of a Graph\n\nFind a maximum leaf spanning tree of a family of circulant networks.","distinct":true,"url":"https://api.github.com/repos/lexmuga/leafNumber/commits/d38d234e845ae34ecf2c085246dcac68ee02ac46"}]}