代码拉取完成,页面将自动刷新
This project contains a Java implementation of A* (A star) search algorithm
that is widely used in path finding and graph traversal, and Dijkstra algorithm
that is used in Cisco router shortest path finding.
There are great similarities in the two algorithms, with the difference being that
A* has a heuristic mechanism while Dijkstra does not. With the heuristic, A*
usually outperforms Dijkstra in speed in finding a path, however, unlike Dijkstra,
the path A* finds may not always be the optimal one.
A Java/Swing graphical demo program is provided to animate the progress of
path searching, and the two resulted paths side by side for comparison.
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。