{"push_id":2985917165,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6af72d8e416555949ae2d322dd1378403288bf35","before":"b9933db23a554dfef72ebed2368c011c9a427512","commits":[{"sha":"6af72d8e416555949ae2d322dd1378403288bf35","author":{"name":"jooyounghun","email":"7782da29b0b7fedb2ef0d9207cb203619d8df74c@gmail.com"},"message":"BFS - minimum path algorithm","distinct":true,"url":"https://api.github.com/repos/jooyounghun/algorithm_study/commits/6af72d8e416555949ae2d322dd1378403288bf35"}]}
{"actor":{"display_login":"jooyounghun"}}