|
|
This picture shows the static image of the Breadth First Search. When the actual VRML world is viewed, the user can click on the red ball to start the animation. The ball searches the tree in a level-by-level fashion which is the basis of Breadth First Search, that is, all the nodes on a single level will be searched before their descendants. Breadth First Search is an example of an exhaustive search procedure and is guaranteed to a find a solution(s) if there is one. |
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: