{"push_id":2616145487,"size":11,"distinct_size":11,"ref":"refs/heads/master","head":"8f64b216a62d1d32682ed9f8a51e814a04d4a588","before":"1eccac1e2e8422d517dbb900e75844213ea2b81d","commits":[{"sha":"7f9aa9810469d61679f185ec06bdb58f50f171c4","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"lab11","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/7f9aa9810469d61679f185ec06bdb58f50f171c4"},{"sha":"7e22b6633b8aa496a44827d74d679cbe141c1a29","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"Minimum spanning tree","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/7e22b6633b8aa496a44827d74d679cbe141c1a29"},{"sha":"3ec1418543fd415f79c2a87e9447eb863b634380","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"use this class for dijkstra and prim algorithm","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/3ec1418543fd415f79c2a87e9447eb863b634380"},{"sha":"bf828b6aa84df038847dad71513c11be56f82200","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"directedGraph stuff","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/bf828b6aa84df038847dad71513c11be56f82200"},{"sha":"05312ac31404c7da8c229d10cd00f7f82fc5fbd7","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"refactor toString method","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/05312ac31404c7da8c229d10cd00f7f82fc5fbd7"},{"sha":"12ad430883ed9c5ff718718439335c1427ff7cd7","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"add ArrayHeap into heap package, use for LazyDijkstra algorithm","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/12ad430883ed9c5ff718718439335c1427ff7cd7"},{"sha":"9df2ad0de6854948d074e9a9e4ce9656651ac112","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"shorest path","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/9df2ad0de6854948d074e9a9e4ce9656651ac112"},{"sha":"ed549d1acff80cc099635ec226227b5dcd26b006","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"prim","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/ed549d1acff80cc099635ec226227b5dcd26b006"},{"sha":"c0cace3276384bb11cc06efa00995e29067d07b0","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"check; this algorithm could handle negative edge, but the complexity would become complex..","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/c0cace3276384bb11cc06efa00995e29067d07b0"},{"sha":"0e9e25f6fcf50d8970c5fdd9dbbd3024cbfd0277","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"dijkstra algorithm in algs package will throw exception when if find negative edge","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/0e9e25f6fcf50d8970c5fdd9dbbd3024cbfd0277"},{"sha":"8f64b216a62d1d32682ed9f8a51e814a04d4a588","author":{"name":"porrige","email":"43a7c8810aa6dd0a990ea3f7f670283f91ac3dd3@163.com"},"message":"add another constructor","distinct":true,"url":"https://api.github.com/repos/porrige/cs61b_2016s/commits/8f64b216a62d1d32682ed9f8a51e814a04d4a588"}]}
{"actor":{"display_login":"porrige"}}