{"push_id":713525935,"size":4,"distinct_size":4,"ref":"refs/heads/master","head":"32f31e8731e21edcc3cfe42df860c2f0c95a0360","before":"d53173b6a67827ddfc84e0bb106b035efd9cbb05","commits":[{"sha":"31397f80d1d65828d2c7ecf114aaf3784ece8fc7","author":{"email":"af15c86f8372d8d9f15d7f733a4fbd214e1c1b39@gmail.com","name":"Luis Rodero-Merino"},"message":"Added Bellman-Ford shortest path algorithm","distinct":true,"url":"https://api.github.com/repos/vkostyukov/scalacaster/commits/31397f80d1d65828d2c7ecf114aaf3784ece8fc7"},{"sha":"e832e35ffb88e92669c5b6d460bcc33f83991743","author":{"email":"af15c86f8372d8d9f15d7f733a4fbd214e1c1b39@gmail.com","name":"Luis Rodero-Merino"},"message":"Merge branch 'master' of https://github.com/lrodero/scalacaster","distinct":true,"url":"https://api.github.com/repos/vkostyukov/scalacaster/commits/e832e35ffb88e92669c5b6d460bcc33f83991743"},{"sha":"dad37885583436533374733613c9a6803611dd64","author":{"email":"af15c86f8372d8d9f15d7f733a4fbd214e1c1b39@gmail.com","name":"Luis Rodero-Merino"},"message":"Addressed comments from vkostyukov in first Pull Request to Scalaster #16","distinct":true,"url":"https://api.github.com/repos/vkostyukov/scalacaster/commits/dad37885583436533374733613c9a6803611dd64"},{"sha":"32f31e8731e21edcc3cfe42df860c2f0c95a0360","author":{"email":"66f9cb47aea570dba4ad79f85ffdae00f447b817@gmail.com","name":"Vladimir Kostyukov"},"message":"Merge pull request #17 from lrodero/master\n\nImplementation of Bellman-Ford shortest path algorithm for graphs, after addressing vkostyukov comments.","distinct":true,"url":"https://api.github.com/repos/vkostyukov/scalacaster/commits/32f31e8731e21edcc3cfe42df860c2f0c95a0360"}]}