{"push_id":1428702102,"size":1,"distinct_size":1,"ref":"refs/heads/bugfix/graph-algorithm-improvements","head":"b5a2cf35757a6ea5adf39f30cb91095dae1fd320","before":"7abbd0a289b08b5bbd5659b529dd7abe872389cc","commits":[{"sha":"b5a2cf35757a6ea5adf39f30cb91095dae1fd320","author":{"name":"George Polevoy","email":"a0f61f9952c6e54a39b2b97e21387bd885095bf5@gmail.com"},"message":"Reduce descencancy search to just looking for close relations\n\nDescendancy search now does not contain the entire depth\nas it leaded to combinatorial explosion of operations needed to walk\nthe descendancy.\n\nTo walk the depth you now need to use DepthFirstSearch on the resulting graph\n\nAcyclic graph walk is removed","distinct":true,"url":"https://api.github.com/repos/george-polevoy/DerivedXmlSerializer/commits/b5a2cf35757a6ea5adf39f30cb91095dae1fd320"}]}
{"actor":{"display_login":"george-polevoy"}}