ABSTRACT
In some applications, all vertices in a graph need to be visited exactly once. Such a process is called graph traversal. Tree traversal is a special case of graph traversal. Because the structure of a graph is more complex than the structure of a tree, algorithms for graph traversal are also more complex than algorithms for tree traversal. In the process of graph traversal, each visited vertex should be marked to avoid a vertex being visited more than once.
