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.

is only a line? i think so

9) i can't see the angle so whatever it is just do this: cos(angle) x hypotenuse and then use that answer and they hypotenuse and plug it into this: (answer you just got)^2 + b^2 = (hypotenuse)^2. the first answer will be the answer of the adjacent side and the second answer after this equation will be the opposite side.

10) y = 14 x = √147 or 12.12435565

11) x = 4.8

12) x = 4.2

13) x = 9.3

14) pq: 13.2

qr : 17.6

angle p: 53º

15) angle c: 54.3º

angle a: 35.7º

16) h = 21040

v = 1841

step-by-step explanation:

10) 7/sin(30) = 14 = y

7^2 + b^2 = 14^2

49 + b^2 = 196

b^2 = 196 - 49

√b^2 = √147

x = √147

11) cos(70) x 14 = 4.788282007

x = 4.8

12) tan(25) x 9 = 4.196768923

x = 4.2

13) sin(31) x 18 = 9.270685348

x = 9.3

14) pq: sin(37) x 22 = 13.23993051

pq: 13.2

qr: cos(37) x 22 = 17.56998122

qr : 17.6

angle p: 180 - (37 + 90) = 53º

15) cos-1(7/12) = 54.31466529

angle c: 54.3º

angle a: 180 - (90 + 54.31466529) = 35.68533471

angle a: 35.7º

16) 4 x 5280 = 21120

cos(5) x 21120

h = 21039.63202

h = 21040

sin(5) x 21120

v = 1840.729287

v = 1841