Graph traversal is the problem of visiting all the nodes in a graph in a particular manner, updating and/or checking their values along the way.
Two famous graph traversal algorithms are:
See also:
- tree-traversal is a special case of graph traversal.