A graph exploration algorithm specifies a possible way how a graph can be traversed.

The two most common algorithms are breadth-first search and depth-first search.