Functional Decomposition
Example: naive search
No obvious data structures to decompose
Create new task for each search call
procedure search(A)
begin
if (solution(A)) then
report solution and score
else
foreach child A(i) of A
search(A(i))
endfor
end
end
Previous slide
Next slide
Back to first slide
View graphic version