Question

1. Find the Minimum Spanning Tree of the following graph by using a) Prim Algorithm b) Kruskal Algorithm. 5 A C 3 D 4 1 6 3 B E 5

Name: 1 find the minimum spanning tree of the following graph by using a prim algorithm b kruskal algorithm 5 a c 3 d 4 1 6 3 b e 5 20629
Uploaded: 2023-05-22T00:55:06-08:00
Duration: 1 min 38 s
Channel: Steven Clarke
Description: 1 find the minimum spanning tree of the following graph by using a prim algorithm b kruskal algorithm 5 a c 3 d 4 1 6 3 b e 5 20629

          1. Find the Minimum Spanning Tree of the following graph by using a) Prim Algorithm b) Kruskal Algorithm.
5
A
C
3
D
4
1
6
3
B
E
5

Added by Aaron M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Steven Clarke

05/22/2023

Step 1

The edges connected to A are (A,B) with weight 1, (A,C) with weight 5, (A,D) with weight 3. The minimum weight edge is (A,B) with weight 1. Add this edge to the MST. Now we have nodes A and B in the MST. The edges connected to A or B are (A,C) with weight 5, (A,D) Show more…

Show all steps