Dijkstra PathFinding in Arbitrary Graphs and Raster Images (Update #1)
This is an efficient implementation of Dijkstra's algorithm using a Linked List and a Priority Queue (Binary Heap). Unlike most other path finding implementations found in VBC, this application maintains a topological structure to store and navigate through the graphs. Can import user defined graphs, tile maps and images.
Several test instances are included, all wrapped up in a cool application! Useful for Vehicle Routing, Vector and Raster GIS Applications, AI Path Finding and more. Any comments / suggestions would be really appreciated!
API Declarations'//Update #1 (2005/16/04)
'
'-Import your own BMP, JPG, GIF images!
'-Fixed extreme memory utilization when pruning a graph.
'-Fixed progress bar behaviour when benchmarking a random graph.
'-Fixed .at loading glitches.
'-Fixed error when .ga files had no coordinates.
'-Fixed some file I/O errors.
' Download size: 221 KB
(22(22 Vote))