{"repository":{"description":"Using Breadth-First Search (BFS)) to find any way between two points inside a maze. ","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":472,"owner":"kiromba","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-05-21T06:18:11-07:00","pushed_at":"2013-05-22T06:13:19-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/kiromba/maze/compare/468b0fb0d3...48d6dc3050"}