{"push_id":2639301988,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f0157a94b7204069275db478027bdb22a0a1feb0","before":"9620dcb47bfd667b1766ca5b0b6de914b0c2e798","commits":[{"sha":"f0157a94b7204069275db478027bdb22a0a1feb0","author":{"name":"Divyanshu Gupta","email":"7fd9957dcddc2ca4d0e71246dd6f140010bb94a0@gmail.com"},"message":"K_cores.cpp\n\nGiven a graph G and an integer K, K-cores of the graph are connected components that are left after all vertices of degree less than k have been removed.","distinct":true,"url":"https://api.github.com/repos/DivyanshuGupta9121997/Graph-traversals-using-Adjacent-List-representations/commits/f0157a94b7204069275db478027bdb22a0a1feb0"}]}
{"actor":{"display_login":"DivyanshuGupta9121997"}}