Kizspy | Question: 48
(Choose 1 answer)
(See picture)
A. gh, bc B. gh, bd
C. bc, be
D. bc, fi
If we use the Kruskal algorithm to find a minimum tree, what are the seventh and eighth edges (in correct order) added?
We always assume that an edge is written with two endpoints following the alphabet order (which means we write edge "ad"instead of "da"). We suppose that at each stage, if we have many choices, we will choose in reverse dictionary order. For example, if we have to choose between edges 'bc', 'de', 'az',we will choose 'de' first.
5
3
7
4
6
2
6
5
3
1
f
4
3
8
4
4
2
g
h
i
