{"push_id":1326980750,"size":1,"distinct_size":1,"ref":"refs/heads/graph-paths","head":"4c1e68696e22aafaf303c83aba3c57c7dd489d63","before":"f7c359b2e5adc60edf3074c906bdd9a0c62a9023","commits":[{"sha":"4c1e68696e22aafaf303c83aba3c57c7dd489d63","author":{"name":"Sergy Kanaev","email":"4d3d647189fc9eb9877c19354416bc9f14709fef@gmail.com"},"message":"Improve undirected graph implementation in expense of data ammount\n\n    * double adjacency list for undirected graph","distinct":true,"url":"https://api.github.com/repos/ksergy1/robot/commits/4c1e68696e22aafaf303c83aba3c57c7dd489d63"}]}
{"actor":{"display_login":"ksergy1"}}