Question
Use Kruskal’s algorithm to find a minimal spanning tree in the graph given in Fig. 2.
Answer :
Word Count : 553
To find a minimal spanning tree (MST) in the given graph using Kruskal's algorithm, we follow these steps: ### Step 1: List all the edges with their weights First, we need to extract all the edges from the graph along with their weights. From the provided graph image, the edges and their weights are as follows: - A-B: 2 - A-C: 3 - B-C: 1 - B-D: 4 - C-D: 5 - C-E: 4 - D-E: 6 ### Step 2: Sort the edges in ascending order of weight Next, we sort the ___ ________ ______ _________ ___.
______ __________ ________ _____ _________ ___ _______ ____ __________ ___.
________ ___ ________ _______ _________ ______ __________.
__________ ______ _____ __________ _____ _____ _____ ________ _________.
______ ________ _________ ____ ______ ________.
_________ __________ ____ _______ _______ __________ ___ ______ ___ _______.
_______ _____ _____ ___ _______ _____ _______ ________ _______ __________ ____.
___ ______ _______ _____ _______ ___ _____ _____.
__________ ______ ____ _______ ______.
________ _________ ____ ________ ________ ________ _______ ______ ____ _____.
________ ______ __________ _________ ___ _____.
__________ ____ _______ _________ _______ ____.
___ ________ _______ _____ _________ _____ _______ _______.
_________ ________ ______ ___ __________.
____ ________ __________ ______ ____ ____ _______ _____ _______.
_____ ___ ________ _________ ________ __________ _______ _____ __________ ________ _____ ____.
__________ ______ _______ ___ _______ ___ _____ ___ _________.
______ _________ ____ _______ _____ __________ _________ _________ ______ _____ ______.
____ __________ _____ ______ _____ ______ __________ ______ ___.
____ _____ ____ _____ ________ __________.
______ _______ ______ ____ ____ ______ _________ _____ _____ ________.
________ _____ ______ ___ ___ ____ _____.
________ _________ _________ __________ ______ _____ ______ ____ _________ _____ ________.
__________ __________ _______ ______ _______ _____ ____ __________.
__________ __________ _________ _______ ____.
______ _________ _______ ______ _______ _________ ___.
_________ ______ ___ __________ _______.
____ ____ ______ _______ _____.
____ _______ ________ ____ ___ ___.
___ _________ _______ ____ _____ _______ _____ ____.
___ _____ ________ _____ ______ ____ _______.
____ ____ _________ _____ ________.
_______ __________ _______ ______ ________ _____ ___ _______ _________ ___ _______.
________ __________ _____ ___ ____ _____.
__________ ______ __________ _________ _________ __________ _________ _________.
_______ _____ _____ _____ ___ ___ __________ ____ __________.
_________ _________ _______ _______ __________.
___ _________ ________ ______ ________.
_____ _________ ________ ___ ____ _________ _____ _____.
____ ______ _____ ____ __________ ____ __________ ________.
______ __________ ________ _____ _____ _______ ___ ___ _______ ___ __________ ____.
________ _____ ___ ____ ________.
_______ _________ _____ ___ ________.
________ ___ _________ _____ ______ ______ _____ ___ ___ __________.
_____ ______ _______ ____ _______ ___ _______ ________ ___ ________ ______.
_______ _____ _________ ______ __________ __________ _____ ____.
___ ______ _____ ____ _____ ____.
_____ _____ _______ ________ __________ ______ _____ _________ ____ _____ _______.
________ _____ ____ ______ ____ ____ ______ __________.
____ _________ ___ __________ ___ ___ ________ ___ ___ ____.
_________ __________ _______ _________ ______ ______ ___ _________.
__________ ______ ___ _________ _______.
_____ ________ _____ _____ _____ ________ _________.
________ ___ _________ ___ ______ _________ _________ ____ _________ _____ ____ ___.
_____ _______ _________ _______ _____ ________ _______ ____ _______ __________ _______.
_______ ____ __________ ____ _______ ________ ____ ___ _________ ________.
_____ __________ ___ __________ __________ _____ ______ ______ ___ __________.
_____ _______ __________ _____ ____ __________.
Get Full Answer on WhatsApp
To find a minimal spanning tree (MST) in the given graph using Kruskal's algorithm, we follow these steps: ### Step 1: List all the edges with their weights First, we need to extract all the edges from the graph along with their weights. From the provided graph image, the edges and their weights are as follows: - A-B: 2 - A-C: 3 - B-C: 1 - B-D: 4 - C-D: 5 - C-E: 4 - D-E: 6 ### Step 2: Sort the edges in ascending order of weight Next, we sort the ___ ________ ______ _________ ___.
______ __________ ________ _____ _________ ___ _______ ____ __________ ___.
________ ___ ________ _______ _________ ______ __________.
__________ ______ _____ __________ _____ _____ _____ ________ _________.
______ ________ _________ ____ ______ ________.
_________ __________ ____ _______ _______ __________ ___ ______ ___ _______.
_______ _____ _____ ___ _______ _____ _______ ________ _______ __________ ____.
___ ______ _______ _____ _______ ___ _____ _____.
__________ ______ ____ _______ ______.
________ _________ ____ ________ ________ ________ _______ ______ ____ _____.
________ ______ __________ _________ ___ _____.
__________ ____ _______ _________ _______ ____.
___ ________ _______ _____ _________ _____ _______ _______.
_________ ________ ______ ___ __________.
____ ________ __________ ______ ____ ____ _______ _____ _______.
_____ ___ ________ _________ ________ __________ _______ _____ __________ ________ _____ ____.
__________ ______ _______ ___ _______ ___ _____ ___ _________.
______ _________ ____ _______ _____ __________ _________ _________ ______ _____ ______.
____ __________ _____ ______ _____ ______ __________ ______ ___.
____ _____ ____ _____ ________ __________.
______ _______ ______ ____ ____ ______ _________ _____ _____ ________.
________ _____ ______ ___ ___ ____ _____.
________ _________ _________ __________ ______ _____ ______ ____ _________ _____ ________.
__________ __________ _______ ______ _______ _____ ____ __________.
__________ __________ _________ _______ ____.
______ _________ _______ ______ _______ _________ ___.
_________ ______ ___ __________ _______.
____ ____ ______ _______ _____.
____ _______ ________ ____ ___ ___.
___ _________ _______ ____ _____ _______ _____ ____.
___ _____ ________ _____ ______ ____ _______.
____ ____ _________ _____ ________.
_______ __________ _______ ______ ________ _____ ___ _______ _________ ___ _______.
________ __________ _____ ___ ____ _____.
__________ ______ __________ _________ _________ __________ _________ _________.
_______ _____ _____ _____ ___ ___ __________ ____ __________.
_________ _________ _______ _______ __________.
___ _________ ________ ______ ________.
_____ _________ ________ ___ ____ _________ _____ _____.
____ ______ _____ ____ __________ ____ __________ ________.
______ __________ ________ _____ _____ _______ ___ ___ _______ ___ __________ ____.
________ _____ ___ ____ ________.
_______ _________ _____ ___ ________.
________ ___ _________ _____ ______ ______ _____ ___ ___ __________.
_____ ______ _______ ____ _______ ___ _______ ________ ___ ________ ______.
_______ _____ _________ ______ __________ __________ _____ ____.
___ ______ _____ ____ _____ ____.
_____ _____ _______ ________ __________ ______ _____ _________ ____ _____ _______.
________ _____ ____ ______ ____ ____ ______ __________.
____ _________ ___ __________ ___ ___ ________ ___ ___ ____.
_________ __________ _______ _________ ______ ______ ___ _________.
__________ ______ ___ _________ _______.
_____ ________ _____ _____ _____ ________ _________.
________ ___ _________ ___ ______ _________ _________ ____ _________ _____ ____ ___.
_____ _______ _________ _______ _____ ________ _______ ____ _______ __________ _______.
_______ ____ __________ ____ _______ ________ ____ ___ _________ ________.
_____ __________ ___ __________ __________ _____ ______ ______ ___ __________.
_____ _______ __________ _____ ____ __________.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★