|This picture shows the static image of the Depth First Search. When the actual VRML world is viewed, the user can click on the red ball to start the animation. The ball starts searching the tree from left to right. It searches for a solution starting from the left-most node (level 1) and all its children (children levels of level 1). If the solution is not found, it moves to the next node on the right and searches in the same manner. This process goes on untill a solution is found.|
Students taking the NDSU CS 724 course do not need to understand the internals of the visualization operation. These links are to help if you are interested in the internals of the visualization process. They also should help if you want to use these visualizations in other environment.
The files used for this system are as follows: