Data Structures and Algorithms207510 marksDefinition and Representation of Graphs, Graph Traversal, Mi
Discuss depth first and breadth first traversal of a graph with suitable example.
Discuss depth first and breadth first traversal of a graph with suitable example.[10]
Graph traversal means visiting every vertex of a graph exactly once in a systematic manner. The two standard traversal techniques are: 1. Breadth First Search (BFS) 2. Depth First Search (DFS) --- BFS is one of the simplest methods of graph searching. A vertex is chosen arbitrarily as a root. All...