{"repository":{"description":"《寻路代码》看到一篇寻路博文，自己有兴趣就写了个简单的寻路；大概思路：从A点到B点，算出A点周边可用的格子，再用A*算法中的权重思想，找出权重小的格子，进入该格子，再重复判断，直到没有可用格子或到B为此。算出初始路径后，再优化初始路径得到最终路径，代码很简单，高手放过小弟，合适新手。。。","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"huangzuduan","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-10-15T05:04:13-07:00","pushed_at":"2013-10-15T05:04:13-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/huangzuduan/find_line"}