2022-2023.M.9.PrimKruskal

Use Kruskal's Algorithm to find the minimum spanning tree. Write the edges you used and the weight.

Use Prim's Algorithm to determine the minimum spanning tree. Write the edges you used and the weight. Start at Vertex A.

1) Use Kruskal's Algorithm to find the minimum spanning tree. Write the edges you used and the weight.

2) Use Prim's Algorithm to determine the minimum spanning tree. Write the edges you used and the weight. Start at Vertex A.

3) What is the weight of the Minimum Spanning tree?

Evaluate responses using AI:

OFF

What is the weight of the Minimum Spanning tree?

• 2
• 6
• 3
• 8

What is the weight of the Minimum Spanning tree?

What method did you use to determine the weight? Circle your answer: [Kruskal / Prim]

Evaluate responses using AI:

OFF

What is the weight of the Minimum Spanning tree?

Evaluate responses using AI:

OFF

What is the weight of the Minimum Spanning tree?

Evaluate responses using AI:

OFF

The number of edges in a tree with 32 vertices is 

• 30
  

• 31
• 32
• 33

Find the minimum spanning tree using Prim's algorithm and provide the overall weight of the MST. 

Start at Vertex A.

Evaluate responses using AI:

OFF

Find the minimum spanning tree using Kruskal’s algorithm and provide the overall weight of the MST.

Evaluate responses using AI:

OFF