{"push_id":1413554463,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4f27e8dd4dc81c4331208e5b94f1e162bff9b56f","before":"f35dbf70d3ba7001d1200ef651f83cfd633da1ec","commits":[{"sha":"4f27e8dd4dc81c4331208e5b94f1e162bff9b56f","author":{"name":"Kevin Zhang","email":"7c30f011ca9a0e05127f51d6668f33deb79838a3@gmail.com"},"message":"implement rudimentary topological sort on DAG","distinct":true,"url":"https://api.github.com/repos/chocolatemelt/LLVM-Compiler-Case-Study/commits/4f27e8dd4dc81c4331208e5b94f1e162bff9b56f"}]}
{"actor":{"display_login":"chocolatemelt"}}