PathFinder 1.0

Path finding algorithms visualizer

  Add it to your Download Basket!

 Add it to your Watch List!

0/5

Rate it!
send us
an update
LICENSE TYPE:
GPL (GNU General Public License) 
USER RATING:
UNRATED
  0.0/5
DEVELOPED BY:
Armin Widegreen
HOMEPAGE:
java-apps.org
CATEGORY:
ROOT \ Science and Engineering \ Visualization
3 PathFinder Screenshots:
PathFinderPathFinderPathFinder
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

Last updated on November 21st, 2009

requirements

#path finder #algorithms visualizer #path #finder #algorithms #visualizer

Add your review!

SUBMIT