{"repository":{"description":"Given an m x n matrix of integers, this program computes the minimal path from left to right across the matrix. This path will start from anywhere in column 1 and consists of a sequence of steps terminating in column n.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":2368,"owner":"harry1357931","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-07-04T11:13:51-07:00","pushed_at":"2013-07-04T11:17:45-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Gurpreet Singh","blog":"http://gurpreetsinghny.com/","location":"New York","email":"fa9907ae057a158a564b0c2a5c581d96a13c4048@gmail.com"},"url":"https://github.com/harry1357931/ShortestPathProblem-In-2D-Array/compare/5907f91d5d...e50c7e158b"}