Data Structure Visualization - Breadth First Search
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
A visualization system that includes numerous data structures and algorithms. This BFS visualization shows the graph either as a logical graph, adjacency list, or adjacency matrix. |
||||
Evaluation |
The visualization works well and displays the basic idea of the algorithm. The visualization shows the graph (in one of the views mentioned above) as well as the queue. In each step of the algorithm, the current node is highlighted. The user is able to generate new graphs and change between small/large and directed/undirected graphs. Own input data is not supported but the user can change the start node and randomize the graph. Animation can be played or stepped through step-by-step. All in all, this gives a good presentation of the BFS algorithm, but for someone unfamiliar with the algorithm explanations or pseudo code would be helpful. |
||||
Animation; Step Control; Random Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-02 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
