Data Structure Visualization - Depth 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 DFS 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 explanations of the steps are minimal, although sufficient for a student somewhat familiar with the DFS algorithm. In each step of the algorithm, the current node is highlighted and the visit-order is shown. 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 generate new random graphs. Animation can be played or stepped through step-by-step. This AV would be Recommended if it had some sort of step-by-step explanation of what was going on. |
||||
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. |
