PathFinder is a software for visualizing path finding algorithms, using Swing. It was developed within a course at our university. The application can visualize the whole calculation of the implemented path finding algorithms.
These algorithms are:
- A*
- Depth first
- Depth first with heuristic
- Breadth first
- Hill climbing
- Beam search
- British museum
- Branch and bound
- Dijkstra
- Depth limited
- Great deluge
Some algorithms can also be parameterize e.g. the underlying heuristic, some storage-adjustments (for the stack or queue), orientations, etc..
More features:
- Graph-Editor: to build your own graph (xml-based)
- four predefined graphs: a rough german streetmap (main streets and highways) and some educational graphs for demonstration-purposes
- statistics: calculation-time, path-length, amount of nodes visit (backtracking-nodes)
- player-component: replay the calculation (adjustable), stepwise calc-tracking
- algorithm help-context: algorithm descriptions, depending parameter (heuristic etc.) - poorly written, it was the last thing we've done ;)
- graph and backtracking color-adjustments
- graph comparison
Product's homepage
Requirements:
· Java 2 Standard Edition Runtime Environment
Find us on Google+
