{"repository":{"description":"uses dijkstra's algorithm to calculate the average path cost for a randomly generated graph","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":100,"owner":"replay","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-10-25T04:08:48-07:00","pushed_at":"2013-10-26T03:46:33-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Mauro Stettler","company":"www.thenetcircle.com","blog":"mauro-stettler.blogspot.com","location":"Shanghai","email":"7440d3dfac5d7ce1eb11ec47df5ea69143dae2b0@gmail.com"},"url":"https://github.com/replay/dijkstra_avg_path_cost/compare/a63e6866d1...f85563d3c3"}