{"push_id":1210785953,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"0bd18378d1047248853146bfd7de709a5e71bb81","before":"f87751ab876b5dfef32fd742273cfe6b60299496","commits":[{"sha":"5157310ff074f19f60753f0ed66c71ee6f1e93a0","author":{"name":"zsenseless","email":"53ad04fe82817e2b9f3693007c0819bd50aee882@gmail.com"},"message":"Modify bellmanFord\n\nSet outermost relaxation loop iterator to be consistent with other\nimplementations.","distinct":true,"url":"https://api.github.com/repos/zsenseless/utvpi/commits/5157310ff074f19f60753f0ed66c71ee6f1e93a0"},{"sha":"67fca5f443c465e607da9c261eefabfb7ccf85af","author":{"name":"zsenseless","email":"53ad04fe82817e2b9f3693007c0819bd50aee882@gmail.com"},"message":"Modify backtrack() in lahiriOpt and lahiriOpt2\n\nThere's no reason to check for edge->backtrackSeen == true when we\nalready know the loop will end when edge == NULL.","distinct":true,"url":"https://api.github.com/repos/zsenseless/utvpi/commits/67fca5f443c465e607da9c261eefabfb7ccf85af"},{"sha":"0bd18378d1047248853146bfd7de709a5e71bb81","author":{"name":"zsenseless","email":"53ad04fe82817e2b9f3693007c0819bd50aee882@gmail.com"},"message":"Implement bellmanFordOpt2\n\nAll Opt2 functionality lifted wholesale from lahiriOpt2. Still\nBellman-Ford handles difference constraint systems in a more simple\nmanner than subWojInt or lahiri, so if that's all you have,\nbellmanFordOpt2 is the way to go.","distinct":true,"url":"https://api.github.com/repos/zsenseless/utvpi/commits/0bd18378d1047248853146bfd7de709a5e71bb81"}]}
{"actor":{"display_login":"zsenseless"}}