{"repository":{"description":"In a adjacent list Graph, find the shortest path between two Nodes by Dijkstra's algorithm.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"crazykeyboard","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-09-11T19:31:35-07:00","pushed_at":"2013-09-11T19:31:35-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"crazykeyboard","company":"buaa","email":"a9f0f29b5b172d84e4c65d8e2a7d2ca0812e6334@gmail.com"},"url":"https://github.com/crazykeyboard/Graph-AdjList-Dijkstra"}