Searching Techniques In Computing

In mathematics and computer science, graph theory is the study of graphs. Mathematical structures are used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and a collection of edges that connect pairs of vertices. A graph may be undirected, which means that there is no distinction between the two vertices associated with each edge or its edges may be directed from one vertex to another vertex. The development of graphs therefore of major interest in computer science. In this paper , for mathematical computing, the two search methods namely BFS, DFS are thoroughly analyzed by means of  definitions, analysis of the algorithms followed by findings and observations.