OtherSearchTrees - Algoviz Wiki

Works

Yes

Description

Demonstrates building a Radix Trie. Given a set of values, the trie structure is built step by step.

Evaluation

Sophisticated use of pseudocode, that can expand to show more or less detail. Has an explanation window for how the data structure works. Slightly limited in that it doesn't support delete, but does a good job at what it does support.

Animation; Step Control; Canned Data; Random Data

Lecture Aid; Self Study

Screenshots

Videos

References

The link above takes you to the AIA demonstration index page. Click on the link to the desired AV, and it should load in your browser as a multi-paned Java applet. Note that the level of detail shown in the visualization is directly tied to the level of detail that you choose to expose in the pseudocode pane.

First Visited

2008-07-02

Last Visited

2010-02-10

Last Updated

2000

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://ww2.cs.mu.oz.au/aia/demoindex.html

Edit

You may edit this entry if you have an account.

Algorithms In Action - Multiway Radix Trie

Recommendation

Recommended

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Linda Stern; Lee Naish; Harald Sondergaard

Institution

University of Melbourne

Project

AlgorithmsInAction

Works

Yes

Description

Demonstrates building a multiway Radix Trie. Given a set of values, the trie structure is built step by step.

Evaluation

Animation; Step Control; Canned Data; Random Data

Lecture Aid; Self Study

Screenshots

Videos

References

First Visited

2008-07-02

Last Visited

2010-02-10

Last Updated

2000

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://dbs.mathematik.uni-marburg.de/research/projects/dsn/

Edit

You may edit this entry if you have an account.

Data Structures Navigator - Binary Search Trees - Treap

Recommendation

Has Potential

Link

Delivery Method

Java Application

License

Unavailable

Language

English

Author

Jens-Peter Dittrich; Jochen van den Bercken; Tobias Schäfer; Marcus Klein

Institution

Phillips-University of Marburg

Project

Data Structure Navigator

Works

Yes

Description

Allows user to insert/find/delete values in a Treap.

Evaluation

Easy to use interface, nice graphics. The main problem is that there is no explanation of what is going on. The user can step through the rotation operations one by one, but any given splay operation happens rather quickly with no explanation of the process. So the user needs to already understand how the treap works (at least in principle) to get much from this.

Step Control; Animation; User Data

Lecture Aid; Self Study

Screenshots

Videos

References

First Visited

2006-09-01

Last Visited

2008-07-16

Last Updated

2000-07-31

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cs.auckland.ac.nz/software/AlgAnim/trie.html#trie_anim

Edit

You may edit this entry if you have an account.

Auckland - Trie Animation

Recommendation

Has Potential

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

John Morris

Institution

University of Auckland

Project

Morris' Collection

PartOfCollection

Works

Yes

Description

The visualization has two panes, left pane showing the current state(with active and inactive nodes) of the Trie and the right pane showing the current trie (with current nodes) being worked on. Has inbuilt 4 test sets. Doesn’t get user input. Works in animation and step wise mode. Skip button helps to skip one iteration. Explanation being displayed at the bottom of the page. The speed of the animation can be configured by the user as well in addition to the ability to enable/disable the animation.

Evaluation

There aren’t much visualization available for Trie. A pretty good effort though a lot of things could have been better. The necessity of having two panes cannot be justified properly. The explanations are too meager and barely useful. 5 test sets provide good base for the users to look at. It is understood that implementing provisions for getting user inputs would take a lot of effort. Source code is hidden in the menu. The source code is traced through along with the visualization which is a very good effort. But the visualization and the source code do not gel well because they are available as two separate windows. Moreover, source code is too long and is sure to test the patience of the user (a short pseudo code would have been sufficient in this visualization). Animation mode is really not needed in this scenario. The visualization is not all that intuitive and the constructed Trie suffers from readability issues. Nevertheless, there aren’t much Trie visualizations available and hence this effort needs to be appreciated. Good to be used as reference in a classroom by the instructor.

Step Control; Animation; Canned Data

Lecture Aid

Screenshots

Videos

References

First Visited

2008-06-13

Last Visited

2008-07-17

Last Updated

2004

Topic

Community

Average rating:	3.0
Your rating:	You must be logged in to Rate.

http://www.cs.auckland.ac.nz/software/AlgAnim/opt_bin.html#opt_bin_anim

Edit

You may edit this entry if you have an account.

Auckland - Optimal Binary Search Tree

Recommendation

Has Potential

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Woi Ang; John Morris

Institution

University of Auckland

Project

Morris' Collection

PartOfCollection

Works

Yes

Description

Applet which purports to teach about optimal binary trees; hard to learn algorithm from this visualization. It looks a little like the concept behind a huffman coding tree, but using something like dynamic programming to rearrange the nodes. The goal seems to be to 'order' the nodes by frequency to get the optimal search cost in terms of number of accesses to find the key values.

Evaluation

Strengths: animated; simple UI. Weaknesses: unclear what is being demonstrated just from the visualization--would require explanation from instructor or accompanying webpage. There is an accompanying web page, which helps, but its not enough to make a lot of sense of this.

Lecture Aid

Screenshots

Videos

References

First Visited

2006-08-01

Last Visited

2008-07-17

Last Updated

1998

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cs.hut.fi/Research/TRAKLA2/exercises/index.shtml

Edit

You may edit this entry if you have an account.

Trakla - Trie; Digital and Radix Search Trees

Recommendation

Has Potential

Link

Delivery Method

Java Application

License

GPL

Language

English

Author

Ville Karavirta; Ari Korhonen; Lauri Malmi; Kimmo Stålnacke

Institution

Helsinki University of Technology

Project

Trakla2

Works

Yes

Description

Exercises related to building a trie, and Digital and Radix Search Trees. User point at locations in the tree where the nodes should go.

Evaluation

This cannot work on its own, since there is no explanation of the structures being presented. It should be easy to use if the user understands the algorithm. The trie seems the most accessible of the three.

Canned Data; Predictions

Lecture Aid; Self Study; Lab Exercise

Screenshots

Videos

References