Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
 | Which is the cost of a minimum spanning tree of the weighted graph using Krurskal’s
Algorithm? | | | |
|
|
|
2.
|
 Which of the graphs below correctly use Krurskal’s Algorithm to determine a minimum
spanning tree?
| | | |
|
|
|
3.
|
 | Using the Breadth-First Search Algorithm, which shows a correct minimum spanning tree of the
graph shown starting at vertex ‘A’? | | | |
|
|
|
4.
|
Create a spanning tree using the
breadth-first search algorithm. Start at A (i.e. 0). What is the maximum number of edges need
to connect any other vertex to vertex ‘A’?
(i.e. What is the biggest number associated with any
vertex?) | | | |
|