Depth-first search is one of the flexible basis for implementing graph
Consider the graph represented in the above figure. States are
leveled as A,B,C,D.... . In Depth_first search method, search goes
deeper into the search space whenever this is possible. Depth-first search
examines the states in the figure in the order A, B, D, H, I, E, C, F, G,
Interpretation of Results:
To control the starting of demonstation, there is a sphere in the VRML
image. If a student clicks on the sphere, the ball starts to move.
First the ball goes deeper whenever it is possible.When it is not possible
to go deeper, it returns at the starting position and goes deeper
through another path.
Figure 1: depth first search
To see Depth-first search demonstration, CLICK on the above picture.