Consider the network (G, w) with V(G) = {a, b, c, d, e, f}, E(G)= {ab, ac, ad, ae, af, bc, bd, be, bf, cd, ce, cf, de, df, ef}, and w(ab) = 9, w(ac) = 8, w(ad) = 12, w(ae) = 3, w(af) = 15, w(bc) = 5, w(bd) = 6, w(be) = 13, w(bf) = 10, w(cd) = 4, w(ce) = 14, w(cf) = 2, w(de) = 16, w(df) = 11, w(ef) = 7. (a) Use Kruskal's algorithm to find a minimum spanning tree of (G, w). List the edges of the tree in the order in which they are added, and draw the tree.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 19EQ: For Exercises 19 and 20, determine the currents for the given electrical networks. 19.
icon
Related questions
Question
1. Consider the network (G, w) with
V(G)= {a, b, c, d, e, f},
E(G)= {ab, ac, ad, ae, af, bc, bd, be, bf, cd, ce, cf, de, df, ef},
and
w(ab) = 9,
w(ac) = 8,
w(ad) = 12,
w(ae) = 3,
w(af) = 15,
w(bc) = 5,
w(bd) = 6,
w(be) = 13,
w(bf) = 10,
w(cd) = 4,
w(ce) = 14,
w(cf) = 2,
w(de) = 16,
w(df) = 11,
w(ef) = 7.
(a) Use Kruskal's algorithm to find a minimum spanning tree of (G, w). List the
edges of the tree in the order in which they are added, and draw the tree.
Transcribed Image Text:1. Consider the network (G, w) with V(G)= {a, b, c, d, e, f}, E(G)= {ab, ac, ad, ae, af, bc, bd, be, bf, cd, ce, cf, de, df, ef}, and w(ab) = 9, w(ac) = 8, w(ad) = 12, w(ae) = 3, w(af) = 15, w(bc) = 5, w(bd) = 6, w(be) = 13, w(bf) = 10, w(cd) = 4, w(ce) = 14, w(cf) = 2, w(de) = 16, w(df) = 11, w(ef) = 7. (a) Use Kruskal's algorithm to find a minimum spanning tree of (G, w). List the edges of the tree in the order in which they are added, and draw the tree.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning