{"push_id":892201467,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"9e87f5ae8bba2bce9c142c5f256061da62e4e515","before":"0c5ad438f07b6b643d4ccc4a5ae6acbd01586cab","commits":[{"sha":"814e068c546f21432d6e477b8be8098b9a3472d7","author":{"email":"1c519ec6e1b56c3948d007d58d52a77ecc9397bf@mantex.se","name":"Mattias Åslund"},"message":"Improved formula for assigning essential links.\nStill not passing test 11, which fails on not all nodes being attached.","distinct":true,"url":"https://api.github.com/repos/aquamoth/CodeinGame/commits/814e068c546f21432d6e477b8be8098b9a3472d7"},{"sha":"1b8ca472f990a66686427dcf17fbbf6da4359ac5","author":{"email":"1c519ec6e1b56c3948d007d58d52a77ecc9397bf@mantex.se","name":"Mattias Åslund"},"message":"Implemented closed loop detection to prevent node islands.\nONLY failing on CG test (test 11) due to timeout problems.\nNeed to optimize bruteforce more.","distinct":true,"url":"https://api.github.com/repos/aquamoth/CodeinGame/commits/1b8ca472f990a66686427dcf17fbbf6da4359ac5"},{"sha":"9e87f5ae8bba2bce9c142c5f256061da62e4e515","author":{"email":"1c519ec6e1b56c3948d007d58d52a77ecc9397bf@mantex.se","name":"Mattias Åslund"},"message":"By brutforcing the shortest paths first, the CG-test succeeds!","distinct":true,"url":"https://api.github.com/repos/aquamoth/CodeinGame/commits/9e87f5ae8bba2bce9c142c5f256061da62e4e515"}]}