Data Structures and Algorithms20815 marksDefinition and Representation of Graphs, Graph Traversal, Mi
Write short notes on: a. Breadth First traversal of graph b. TOH
Write short notes on: a. Breadth First traversal of graph b. TOH [5]
--- Definition: BFS is one of the simplest methods of graph searching/traversal. It explores a graph level by level, visiting all neighbors of a vertex before moving to the next level. Algorithm / Steps: 1. Choose some vertex arbitrarily as the root (starting vertex). 2. Visit the root and add al...