1 Star 0 Fork 0

dungang / PathFinder

Create your Gitee Account
Explore and code with more than 8 million developers,Free private repositories !:)
Sign up
Clone or Download
Cancel
Notice: Creating folder will generate an empty file .keep, because not support in Git
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.

Repository Comments ( 0 )

Sign in to post a comment

About

镜像 expand collapse
Apache-2.0
Cancel

Releases

No release

Contributors

All

Activities

Load More
can not load any more
1
https://gitee.com/dungang/PathFinder.git
git@gitee.com:dungang/PathFinder.git
dungang
PathFinder
PathFinder
master

Search

184635 d8eb8a04 1850385 161156 f1cf3f24 1850385