{"repository":{"description":"EWU Distributed computing project.  Finding the knight's tour on an irregular chessboard using MPI","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":684,"owner":"oraac","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-03-05T16:04:32-08:00","pushed_at":"2013-03-19T23:07:24-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"David McInnis","company":"Eastern Washington University","location":"Cheney, WA","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/oraac/ewu-knight-mpi/compare/f9a4cc59b5...de9acdeeff"}