{"push_id":3096923635,"size":7,"distinct_size":6,"ref":"refs/heads/develop","head":"416e14dc2c99ab83aa7ce3f1f700eb345730be9d","before":"90fc6ea3c9d99e2b4826466774dcd71150910077","commits":[{"sha":"8719c7dd32fd350254a11c39f0a2becdfb068b30","author":{"name":"Patrick M Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"Typo in readme.","distinct":false,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/8719c7dd32fd350254a11c39f0a2becdfb068b30"},{"sha":"a8bb330490ed7411e7da621732f2f78f96955dfa","author":{"name":"Patrick Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"Working on 1B download functionality.","distinct":true,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/a8bb330490ed7411e7da621732f2f78f96955dfa"},{"sha":"d0b751045106596c4402ec6f1342a4e5874d8dc0","author":{"name":"Patrick M Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"dg1b parts command returning json now.","distinct":true,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/d0b751045106596c4402ec6f1342a4e5874d8dc0"},{"sha":"286fa27dfc139aa63cb434203b6986f02be0adfe","author":{"name":"Patrick M Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"rda template describe cmd for returning a description of a template.\n\nA bunch of groundwork in here for being able to upload a template\nyourself, parsing the response as a graph, etc.","distinct":true,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/286fa27dfc139aa63cb434203b6986f02be0adfe"},{"sha":"4ca2edc6257a8ccce0e9a4d794518db0aa318207","author":{"name":"Patrick M Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"Check for cycles in the graph when parsing them from a reader.","distinct":true,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/4ca2edc6257a8ccce0e9a4d794518db0aa318207"},{"sha":"4e801726314b7c0031d1d5e9db9e4ebd5cecb711","author":{"name":"Patrick Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"Find \"best\" default node if none given when parsing a rda graph.\n\nWe do this via a topological sort and finding the longest path in the\nDAG.","distinct":true,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/4e801726314b7c0031d1d5e9db9e4ebd5cecb711"},{"sha":"416e14dc2c99ab83aa7ce3f1f700eb345730be9d","author":{"name":"Patrick M Young","email":"e18c54606a14d6f003fbdcf1924f205cffab4c5d@gmail.com"},"message":"More tests around processing the graph.","distinct":true,"url":"https://api.github.com/repos/DigitalGlobe/rdatools/commits/416e14dc2c99ab83aa7ce3f1f700eb345730be9d"}]}
{"actor":{"display_login":"youngpm"}}