{"push_id":742490168,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"770137ade96ae6ef8e2a53d9e6305bc5575650c6","before":"cd2a2f11bd74c1ef87df270a45e80019956c757b","commits":[{"sha":"770137ade96ae6ef8e2a53d9e6305bc5575650c6","author":{"email":"33006a5e65bf99a711a947234de54afea97281bb@gmail.com","name":"Kirill Panarin"},"message":"Kosraju algorithm: search for strongly connected graph components","distinct":true,"url":"https://api.github.com/repos/stormy-ua/AlgorithmsDA/commits/770137ade96ae6ef8e2a53d9e6305bc5575650c6"}]}