{"push_id":3062492637,"size":2,"distinct_size":2,"ref":"refs/heads/workflow-convergence","head":"c72603aeb48dd21ed59d06a68373659bc63523d1","before":"e1580318dd9bcac3331ff6aac9a291832be911f5","commits":[{"sha":"c75098c8af814e3f3694e602565bae66b53caa03","author":{"name":"chris meyers","email":"43befb46225c02aee8c7ca12620586da9cc90a4a@gmail.com"},"message":"Revert \"optimize mark dnr nodes algorithm\"\n\nThis reverts commit 6372c52772e26f64f3b4fd227ffb5e401d3688e1.","distinct":true,"url":"https://api.github.com/repos/ansible/awx/commits/c75098c8af814e3f3694e602565bae66b53caa03"},{"sha":"c72603aeb48dd21ed59d06a68373659bc63523d1","author":{"name":"chris meyers","email":"43befb46225c02aee8c7ca12620586da9cc90a4a@gmail.com"},"message":"loop over dnr nodes by topological sort\n\n* Perform topological sort on graph nodes before looping over them to\nmark do not run. This guarantees that parent nodes will be processed\nbefore calling dependent child nodes. The complexity of the sorting is\nN. The complexity of marking the the nodes is N*V","distinct":true,"url":"https://api.github.com/repos/ansible/awx/commits/c72603aeb48dd21ed59d06a68373659bc63523d1"}]}
{"actor":{"display_login":"chrismeyersfsu"}}