{"push_id":1400181738,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"5a6f949334980dacf914922889981905f5197abd","before":"fafddd987dfb2a87d168d716e3a2f78df4d6bf89","commits":[{"sha":"5a6f949334980dacf914922889981905f5197abd","author":{"name":"seo,yeonghak","email":"fd019c888440ec9be6f3aa45cd4395d2f3e79ed0@naver.com"},"message":"Implement Minimum Spanning Tree by Prim's Algo\n\nImplement MST by prim using min queue.\nPrim's algorithm is similar to Dijkstra. It stock vertex in queue and save\nthe minimum path point.","distinct":true,"url":"https://api.github.com/repos/inspire12/Algorithm/commits/5a6f949334980dacf914922889981905f5197abd"}]}
{"actor":{"display_login":"inspire12"}}