1 Star 0 Fork 0

dungang / PathFinder

加入 Gitee
与超过 600 万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
取消
提示: 由于 Git 不支持空文件夾,创建文件夹后会生成空的 .keep 文件
Loading...
README.txt
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.

仓库评论 ( 0 )

你可以在登录后,发表评论

简介

镜像 展开 收起
Apache-2.0
取消

发行版

暂无发行版

贡献者

全部

近期动态

加载更多
不能加载更多了
1
https://gitee.com/dungang/PathFinder.git
git@gitee.com:dungang/PathFinder.git
dungang
PathFinder
PathFinder
master

搜索帮助