Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach vertex 'H' starting from vertex 'A'>

Group of answer choices

3

4

5

6

Step-by-step explanation:

Breadth-First Search is an algorithm to search in a data structure. It starts at the tree root and explores all the neighbor nodes.

Applying this algorithm, you would find that the minimum number of edges that it would require to reach vertex H from vertex A is 3.

We start at vertex A and explore each neighbor node which are B, C and D. If you go through vertex B, you would pass through 4 vertecis to get to H, if you go through C, there would be also 4 vertices. However, if you go through D, you would pass through only 3 vertices.

Therefore, the answer is 3.