{"push_id":3141630163,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"237f6baba5f56d5f69ae52f2b0f3bf0c5efd7668","before":"8ee75df8316811a3ad9690e0e05e75bc6197fff1","commits":[{"sha":"237f6baba5f56d5f69ae52f2b0f3bf0c5efd7668","author":{"name":"wer4ty","email":"11043c7b12541c75988cdfc5ae1929df9f6f1bad@bitbucket.org"},"message":"Floyd Warshall algorithm find minimal distance between any two vertices in graph with positive and negative weigths","distinct":true,"url":"https://api.github.com/repos/wer4ty/graph_js/commits/237f6baba5f56d5f69ae52f2b0f3bf0c5efd7668"}]}
{"actor":{"display_login":"wer4ty"}}