In
computer science,
graph traversal (also known as
graph search) refers to the process of visiting (checking and/or updating) each vertex in a
graph. Such traversals are classified by the order in which the vertices are visited.
Tree traversal is a special case of graph traversal.