The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

Animal - Branch and Bounds

Link(s)
http://www.algoanim.info/AnimalAV
Topic(s)
Backtracking, Algorithmic Techniques



Recommendation
  
Lecture Aide Has Potential
Self-study Supplement Has Potential
Standalone Has Potential
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Animal Animation
Project
Animal
Project Relationship
Part of project
Language(s)
English, German
Author(s)
Guido Rößling
Institution(s)
TU Darmstadt, Darmstadt, Germany
Activity Level(s)
Animation, Canned data, Step control
Source Code License
Non-commercial use only
First Published
N/A
Last Modified
N/A

Description

Presents a small tutorial on branch and bounds, and shows an example on a small graph computing a traveling salesman tour.

Evaluation

Reasonably good example, though there is no branch-and-bounds tree, so it is hard to understand the relationship of the B&B process to solving the TS problem. NOTE: There are two other Branch and Bounds demonstrations at this site (one on knapsack problem), but those are hard to follow and would be Not Recommended.

Usage Notes

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.

Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
40