{"push_id":1354146004,"size":4,"distinct_size":1,"ref":"refs/heads/jgraphx-update","head":"d76f81f6100a901f8869a904205d5c415460291c","before":"8934be1f373999cd18b70f8921b6b11f25a7b037","commits":[{"sha":"c5f792e7a7f42a9940002732a1cc519f31f151ed","author":{"name":"Dimitrios Michail","email":"c40925a5240a6a8ba89187cd150003760c2ab881@gmail.com"},"message":"Implementation of Hierholzer's algorithm\n\n - Implemented Hierholzer's algorithm for the computation of an Eulerian cycle\n - Added corresponding interface\n - Added tests\n - Deprecated EulerianCircuit (which had quadratic complexity)","distinct":false,"url":"https://api.github.com/repos/d-michail/jgrapht/commits/c5f792e7a7f42a9940002732a1cc519f31f151ed"},{"sha":"b730773ffee600f3c0200230100730d66286674b","author":{"name":"Joris Kinable","email":"c7792666b86f7d3b77c2005d61eaee94d44d5c16@gmail.com"},"message":"Merge pull request #314 from d-michail/eulerian-circuit-revision\n\nLinear time implementation of Hierholzer's algorithm","distinct":false,"url":"https://api.github.com/repos/d-michail/jgrapht/commits/b730773ffee600f3c0200230100730d66286674b"},{"sha":"380147f8809889b3f365af7b2c5db7e96e45c6a6","author":{"name":"Joris Kinable","email":"c7792666b86f7d3b77c2005d61eaee94d44d5c16@gmail.com"},"message":"Update HISTORY.md","distinct":false,"url":"https://api.github.com/repos/d-michail/jgrapht/commits/380147f8809889b3f365af7b2c5db7e96e45c6a6"},{"sha":"d76f81f6100a901f8869a904205d5c415460291c","author":{"name":"Dimitrios Michail","email":"c40925a5240a6a8ba89187cd150003760c2ab881@gmail.com"},"message":"Updated jgraphx version and fix demo bug","distinct":true,"url":"https://api.github.com/repos/d-michail/jgrapht/commits/d76f81f6100a901f8869a904205d5c415460291c"}]}
{"actor":{"display_login":"d-michail"}}