Searching a graph means systematically following the edges of the graph in order to "visit" or "discover" its vertices.

Graph searching algorithms can discover much about a graph's structure.

For problem state spaces represented as graphs, searching algorithms can find a problem's solution.

We will examine two basic graph search algorithms:

• Breadth-first search, and
• Depth-first search