{"repository":{"description":"Implementations of Breadth First Search, Connected Components, and Dijkstra's Shortest Path algorithm, along with a library for the heap data structure.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":448,"owner":"pAIgn10","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-08-08T23:07:10-07:00","pushed_at":"2013-09-12T16:36:49-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Nick Lamprianidis","location":"Patras, Greece","email":"bbef977e4f48fb3bd7bc939ecce26671ab717e1f@yahoo.com"},"url":"https://github.com/pAIgn10/Dijkstras-Algorithm/compare/175b45363b...a00dcc046b"}