{"repository":{"description":"Implementation of Prim's Minimum Spanning Tree algorithm, along with a library for the heap data structure.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":232,"owner":"pAIgn10","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-09-12T17:01:43-07:00","pushed_at":"2013-10-23T14:08:34-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Nick Lamprianidis","location":"Patras, Greece","email":"bbef977e4f48fb3bd7bc939ecce26671ab717e1f@yahoo.com"},"url":"https://github.com/pAIgn10/Prims-MST-Algorithm/compare/00b0a70332...6354b6c453"}