Find a minimal spanning tree for the following graph using the Prim’s algorithm, showing all the steps. Take v1 as the root.

What is the weight of the minimal spanning tree you get? Give reasons for your answer.

To find the minimum spanning tree (MST) of the given graph using Prim's algorithm, let's go through the steps systematically.

### Step 1: Initialize the MST
- Start from vertex \(v_1\) (as given).
- Include \(v_1\) in the MST set.
- Add edges that connect to \(v_1\) _________ _________ _________ ____ ___ ________ _________ __________ _________ ________ ____ ___.
_______ ___ ______ ___ ____ __________.
____ _______ ___ ______ ___ ___ _______ _______ _____ ________ ________.
___ ___ ____ ___ ___ ____.
______ ____ ______ _________ _____ ______ _________.
____ ____ ____ ________ _______ ________ ___ _________ _____.
_______ ___ ___ ____ ______ _____ ________ ___ _________ ______.
_____ ______ _________ ______ _____ _________ ________ ___ _______ __________ __________.
____ ___ ___ ____ __________ _____.
___ __________ _______ ________ _____ _____ _________ ________.
____ _______ ___ ____ ___ ____ ____ ____ _________ __________ ____ ____.
_________ __________ ____ ___ ___ __________ __________ ________ ________ __________ _____ __________.
____ _________ ____ _____ _____ __________.
________ __________ ___ _____ ________ ____.
______ __________ _________ ___ __________ ___.
________ ___ ___ ____ ______ __________ _______ ___ __________ ___ ______ ____.
_______ _______ ________ _____ _____ ______ __________ ____ _________ ________ ______.
____ _______ ____ __________ ___ ___ ___.
___ _________ __________ _____ _____.
____ ________ _____ ___ ____ __________.
________ ____ _______ _____ ________ ___ _________ ____ _________.
_________ _________ ___ __________ _______ ______ _______ ________ ____.
____ _____ _________ _________ ______ _______ ____.
______ ________ ___ ____ ______ ____ ____.
Get Full Answer on WhatsApp