Question

2 B E 8 5 9 7 8 9 9 1 A C F H 4 7 2 1 10 3 D G Draw a minimum spanning tree (MST) of G using Prim's algorithm starting from node A. Label each node to indicate the order in which they were added to the MST (1.5) Draw the minimum spanning tree of G using Kruskal's algorithm. List the edges in the order they are added to the tree (1.5)

          2
B
E
8
5
9
7
8
9
9
1
A
C
F
H
4
7
2
1
10
3
D
G
Draw a minimum spanning tree (MST) of G using Prim's algorithm starting from node A. Label each
node to indicate the order in which they were added to the MST (1.5)
Draw the minimum spanning tree of G using Kruskal's algorithm. List the edges in the order they are
added to the tree (1.5)

2
B
E
8
5
9
7
8
9
9
1
A
C
F
H
4
7
2
1
10
3
D
G
Draw a minimum spanning tree (MST) of G using Prim's algorithm starting from node A. Label each
node to indicate the order in which they were added to the MST (1.5)
Draw the minimum spanning tree of G using Kruskal's algorithm. List the edges in the order they are
added to the tree (1.5)

Added by Jeffrey A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Ali Karimiafshar

Step 1

First, let's start with Prim's algorithm: Show more…

Show all steps

Thanks for your feedback!

Draw a minimum spanning tree (MST) of G using Prim's algorithm starting from node A. Label each node to indicate the order in which they were added to the MST. Draw the minimum spanning tree of G using Kruskal's algorithm. List the edges in the order they are added to the tree.