{"push_id":1131614570,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"2a7061f1c1d9aafe3064b3060a49a0dd996d9772","before":"d7ae20f7d37fee9c5123432ee79765329308fa1e","commits":[{"sha":"41777314fe33dbd54e4665960d52a97e2f2ce9dd","author":{"name":"duaraghav8@gmail","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"message":"Bridge-Finding in O(V+E) time","distinct":true,"url":"https://api.github.com/repos/nem035/AlgorithmVisualizer/commits/41777314fe33dbd54e4665960d52a97e2f2ce9dd"},{"sha":"9dec15e2e13426c6a83263320163617942beb29d","author":{"name":"duaraghav8@gmail","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"message":"Merge remote-tracking branch 'upstream/gh-pages'","distinct":true,"url":"https://api.github.com/repos/nem035/AlgorithmVisualizer/commits/9dec15e2e13426c6a83263320163617942beb29d"},{"sha":"2a7061f1c1d9aafe3064b3060a49a0dd996d9772","author":{"name":"Raghav Dua","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"message":"Merge pull request #82 from duaraghav8/master\n\nBridge Finding, O(V+E) time (efficient)","distinct":true,"url":"https://api.github.com/repos/nem035/AlgorithmVisualizer/commits/2a7061f1c1d9aafe3064b3060a49a0dd996d9772"}]}
{"actor":{"display_login":"nem035"}}