PathFinder
PathFinder is framework for finding shortest path in graphs. It includes several algorithms that have various precision and productivity.
Version: 1.0.0
Download (249 times)
GNU General Public License
Version History
Demo.
It helps you to understand how algorithms work.
Mouse down on vertex that will be first anchor in path. You will see blue arrow. Drag your cursor at any desired vertex to construct path.
A* algorithm has problems with complicated graphs like in demo, but A* is very fast.
Dijkstra algorithm always finds correct shortest path.
Benchmark.
Path length determines testing time.
Note: You should know. PathFinder designed for fast path finding, so deleting of vertex from graph is the most expansive operation (consists of several splice operations) in framework.
