Searching the graph means systematically following the edges of the graph, so as to visit the vertices. It helps us in discovering the structure of the graph.
You are being introduced to two great algorithms of graph search. These algorithms make a lot of work possible in linear time:
1) Breadth First Search
2) Depth First Search