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 PSC, 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!