156,217 views
2 votes
2 votes
Create a spanning tree using the breadth-first search algorithm. Start at A (ie 0). What is the maximum number of edges needed to connect any other vertex to vertex 'A'?

Group of answer choices

1

2

3

4

Create a spanning tree using the breadth-first search algorithm. Start at A (ie 0). What-example-1
User Faysal Ahmet
by
3.4k points

2 Answers

3 votes
3 votes

Answer:

The correct answer is 3

Explanation:

I took the quiz

User Abdul Muneer
by
3.3k points
4 votes
4 votes

Answer:

The answer is 2

Explanation:

User Trahane
by
3.0k points