{"push_id":2622259786,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f78ee88f7344443483d461dd877bdc43fdd71d06","before":"b98f524a1104bf44eb0c7dbd3525b7ccfe17c70e","commits":[{"sha":"f78ee88f7344443483d461dd877bdc43fdd71d06","author":{"name":"animeshbiyani","email":"fe1a1ea331daac721facd798e962e439a71da855@users.noreply.github.com"},"message":"Ch3 P3\n\nGiven a directed graph G, print topological ordering if it is a DAG, else print a cycle","distinct":true,"url":"https://api.github.com/repos/animeshbiyani/kleinber-tardos-codes/commits/f78ee88f7344443483d461dd877bdc43fdd71d06"}]}
{"actor":{"display_login":"animeshbiyani"}}