Java Applets Centre - Graph Traversal
Recommendation |
Not Recommended |
||||
Link |
http://www.cosc.canterbury.ac.nz/people/mukundan/dsal/GraphAppl.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
R. Mukundan |
||||
Institution |
University of Canterbury |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Demonstrates DFS and BFS. User "builds" a graph by selecting vertices to connect with edges. Then the user selects the start vertex. The AV then colors nodes showing the order of processing during the traversal, and prints out the visit order. |
||||
Evaluation |
The visualization does not explain the concepts. The ability to draw own graph is unnecessary here, because the tool doesn’t rearrange the graph into a more elegant form after user sets edges of the graph. There is no animation indicating recursion that occurs during the actual traversal algorithms; specifically the concept of “visiting” or “backtracking” a node is not highlighted. There is no control over the animation speed; at least it should be slower or allow the user to step through the animation at his own pace. The visualization tends to wipe out parts when we switch the browser process to the background or scroll up/down the browser window. There is no indication to the user that he needs to click DFS/BFS again, after he chooses the origin node. It will be easier for user to understand, if the author reorients the graph in a top down manner after the user selects an origin node. Also a pseudo-code window to trace the steps would aid the user in understanding the algorithm. |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-04-20 |
||||
Last Visited |
2008-07-21 |
||||
Last Updated |
2006 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
