{"repository":{"description":"Python code that implements an algorithm for finding the maximum submatrix sum of an M by N matrix","homepage":"","watchers":1,"stargazers":1,"forks":0,"fork":false,"size":696,"owner":"thearn","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-10-05T15:34:44-07:00","pushed_at":"2013-10-05T17:46:24-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Tristan Hearn","company":"NASA Glenn Research Center","location":"Cleveland, OH","email":"7ed7f8d755464c1070e7319c94b717977588fe1c@gmail.com"},"url":"https://github.com/thearn/maximum-submatrix-sum/compare/cd854cedd0...edf48f3bb5"}