{"push_id":1198178816,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"f0980d7f16b043fd2537e502389f7405631d9406","before":"da3118560b49d90088d6e662147a7e7e0c2a2853","commits":[{"sha":"271f0c5277f784a9889a2d2ea77614359b1c183a","author":{"name":"Mary Ellen Weber","email":"05e1359c8d27e8de30dba0669424893608f7b2ca@gmail.com"},"message":"Work on knapsack solver.\n\nAdd some error checking to cover difficulties with dynamic programming\ntables when one of the input values is 0 or empty.\nAdd a second table to track the indices of the items that make up the\nbest subset.","distinct":true,"url":"https://api.github.com/repos/mmweber2/adm/commits/271f0c5277f784a9889a2d2ea77614359b1c183a"},{"sha":"f0980d7f16b043fd2537e502389f7405631d9406","author":{"name":"Mary Ellen Weber","email":"05e1359c8d27e8de30dba0669424893608f7b2ca@gmail.com"},"message":"Create test file for knapsack.\n\nAdd two tests: one for an empty itemset and one for 0 capacity.","distinct":true,"url":"https://api.github.com/repos/mmweber2/adm/commits/f0980d7f16b043fd2537e502389f7405631d9406"}]}
{"actor":{"display_login":"mmweber2"}}