{"repository":{"description":"基于Java实现的Dijkstra最短路径寻径的实现.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":418,"owner":"mxcanfly","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-08-04T18:46:21-07:00","pushed_at":"2013-08-04T19:36:38-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/mxcanfly/Java-Dijkstra/compare/b42c8f3a62...f83691411a"}