JHAV' - Depth- and Breadth-first Search
| Collection: | AlgoViz |
| Source: | http://algoviz.org/node/900 |
| Format: | Java Web Start |
Recommendation: Has Potential.
Description: Visualization of the standard depth- and breadth-first graph search algorithms. Includes dynamically highlighted pseudo code. Associated HTML page contains an algorithm description, pseudo code, and example trace, and discussion of efficiency analysis.
Evaluation: The AV is set up as a series of 'slides' in one pane, and pseudocode in the adjacent pane. As the user steps through the 'slides', the associated pseudocode is highlighted. Occasional questions pop up for the user to answer.
| Creator(s): | Tom Naps, Richard Teviotdale |
| Publisher: | University of Wisconsin - Oshkosh |
| Subject: | Graph Algorithms, Graph Traversals |
| Relation: | JHAV' |
| Language: | english |
| Rights: | Licensed under Creative Commons |

