- Published 2012

One of the most fundamental tasks on graphs is searching a graph by starting at some vertex, or set of vertices, and visiting new vertices by crossing (out) edges until there is nothing left to search. In such a search we need to be systematic to make sure that we visit all vertices that we can reach and that we do not visit vertices multiple times. This will require recording what vertices we have already visited so we don’t visit them again. Graph searching can be use to determine various properties of graphs, such as whether the graph is connected or whether it is bipartite, as well as various properties relating vertices, such as whether a vertex u is reachable from v, or finding the shortest path between vertices u and v. In the following discussion we use the notation RG(u) to indicate all the vertices that can be reached from u in a graph G (i.e., vertices v for which there is a path from u to v in G).

@inproceedings{2012GraphSA,
title={Graph Search and BFS Parallel and Sequential Data Structures and Algorithms , 15 - 210 ( Spring 2012 )},
author={},
year={2012}
}