{"repository":{"description":"A set of scripts which create a 2-dimensional UTT space, and utilize Dijkstra's shortest path algorithm to search for the shortest path between two triads in that space.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":108,"owner":"bigpianist","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-04-22T17:08:07-07:00","pushed_at":"2013-04-22T17:24:35-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/bigpianist/UTTSpaces/compare/9dc25d5ac0...11218a804c"}