Watch, Follow, &
Connect with Us

For forums, blogs and more please visit our
Developer Tools Community.

ID: 19538, Shortest Path Demo

by Justin Swett Email: Anonymous

Demo Application using common shortest path algorithms. A hexagonal grid highlight's a path from source node to destination node.
Download Details
FTP  download also available
CDN Login Required to Download. (You will be redirected to the login page if you click on the Download Link)
To download this, you must have registered:
A free membership

For Delphi, Version 7.0  to 7.0 731 downloads
Copyright: No significant restrictions

Size: 451,257 bytes
Updated on Thu, 20 Feb 2003 08:07:51 GMT
Originally uploaded on Fri, 07 Feb 2003 07:49:51 GMT
SHA1 Hash: 8F2A5F51A542BB471AFA6A6808250102A604E1EF
MD5 Hash: 34EFA6654D34FF1C5953551924737591

    Explore the files in this upload

The program uses shortest path algorithms such as Dijkstra and A*, (A-Star). For A*, the heuristic used is max(abs(dx),abs(dy)), which seems to yield pretty good performance as well as optimal path. To see which nodes A-Star is examining you could modify my HeuristicCalc method for WeightedVertex's OnCalcHeuristic. In this event you are passed two vertices to calculate a Heuristic for.

The program also has a map editor, so you can create custom maps to test out the algorithms. In edit mode you can add new tile types and assign them custom cost estimates. These cost estimates will be used in the path finding algorithms.

Notice that the graph class was implemented in such a way that it is not tied to the 2-D surface.

Please feel free to ask questions or send comments to email address provided in ReadMe.

Download now contains EXE for those who can not compile as of Feb 20, 2003.

   Latest Comments  View All Add New

Move mouse over comment to see the full text

Could not retrieve comments. Please try again later.

Server Response from: ETNACDC03