mst-partition

# mst-partition - Engineering Exercises 1 The figure below...

This preview shows pages 1–2. Sign up to view the full content.

Engineering xercises 2. The figure below shows an instance of the partition data Exercises 1. The figure below shows an intermediate state in Kruskal’s algorithm. The tree edges are shown in bold and the non- structure. b j f d e 1 0 1 i 1 a 0 gg singleton sets in the partition data structure are listed as sets. Show the data structure after the following operations are performed: link ( i,a ), link ( d , e ), link ( i,e ). c 0 0 0 g h 0 0 e 2 h e 1 8 5 10 { a , b } { e , d , f } b j f c 0 0 0 0 1 g h i 00 1 a 0 d a b c f d g 6 11 2 4 7 12 9 8 3 Show the state of the algorithm after the next three edges are considered for inclusion by the algorithm. Then, show the data structure after the following operations are performed as well (show the effects of path compression): find ( j ), find ( a ). 2 7 h e 5 10 { a , b } j c e 0 0 1 i 1 a 0 d a d g 6 11 2 4 8 1 8 9 8 3 { e , d , f , h } { c , g } 11 b f g h 0 0 b c f 12 7

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Engineering 3. The height of a node in a tree is the length of a longest path . emma 2.2 was proved for the partition data structure gg g p from the node to one of its descendants. Show that if we leave out the path compression feature of the find operation
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

mst-partition - Engineering Exercises 1 The figure below...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online