4. The following pseudo code represents the hamilton path search algorithm for face stripification in the...

Transcribed Image Text:

4. The following pseudo code represents the hamilton path search algorithm for face stripification in the Beady system. Choose the correct description for the behavior of the code. get_next_faces(face_a, visited) collects unvisited faces adjacent to the face_a, and sorts them according to a heuristic criteria that favors a spiral strip. Pseudo-code 1 function recursive_search(face, visited) { 2 3 4 5 6 7 8 9 10 SE54199 11 12 13 16 17 18. } child_visited = new Set(); child_visited.addAll(visited); child_visited.add(face); next_faces= get_next_faces (face, child_visited); max_strip = new List<Face>(); foreach(Face next_face in next_faces) { strip = recursive_search(next_face, child_visited); if (strip.size() > max_strip.size()) max_strip strip; if (max_strip.size() > 10) } break; max_strip.add(0, face); return nax_strip; breadth first search of the longest path with limited back tracking exhaustive search of the longest path using depth first search depth first search of the longest path without backtracking breadth first search of the longest path with unlimited back tracking depth first search of the longest path with limited back tracking exhaustive search of the longest path using breadth first search breadth first search of the longest path without backtracking O depth first search of the longest path with unlimited back tracking 4. The following pseudo code represents the hamilton path search algorithm for face stripification in the Beady system. Choose the correct description for the behavior of the code. get_next_faces(face_a, visited) collects unvisited faces adjacent to the face_a, and sorts them according to a heuristic criteria that favors a spiral strip. Pseudo-code 1 function recursive_search(face, visited) { 2 3 4 5 6 7 8 9 10 SE54199 11 12 13 16 17 18. } child_visited = new Set(); child_visited.addAll(visited); child_visited.add(face); next_faces= get_next_faces (face, child_visited); max_strip = new List<Face>(); foreach(Face next_face in next_faces) { strip = recursive_search(next_face, child_visited); if (strip.size() > max_strip.size()) max_strip strip; if (max_strip.size() > 10) } break; max_strip.add(0, face); return nax_strip; breadth first search of the longest path with limited back tracking exhaustive search of the longest path using depth first search depth first search of the longest path without backtracking breadth first search of the longest path with unlimited back tracking depth first search of the longest path with limited back tracking exhaustive search of the longest path using breadth first search breadth first search of the longest path without backtracking O depth first search of the longest path with unlimited back tracking

Answer rating: 100% (QA)

The detailed answer for the above question is provided below The correct description for the behavio... View the full answer