nca - Engineering Exercises 1. Consider a depth-first...

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

View Full Document Right Arrow Icon
Engineering xercises 2. Consider an execution of the nca algorithm on the tree Exercises 1. Consider a depth-first search on the tree shown below. If node g is open, what other nodes are open? What nodes are shown below, with the set of node pairs { bi, dh, ef, bg }. Show the state of the algorithm when the search returns from node e . Specifically, show the values in the noa mapping, the sets defined by the partition data structure and the nca values for all pairs for which values have been computed at that point. p, p closed? When the search reaches g , what is noa ( h )? When the search reaches e, what is noa ( g )? a a b c e b c d e f d h i g abcde f g hi how the state when the search reaches returns from partition sets : { a } { b,d,f,g } { c } { e } { h } { i } nca(e,f)=b f h i g noa a b - b e b b - - When g is open, nodes a, b and d are also open. Nodes f, h and i are closed. Nodes c and e are unreached. When the search reaches g, noa(h)=d. When the search reaches e, noa(g)=b.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

nca - Engineering Exercises 1. Consider a depth-first...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online