Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

the boundary is defined as those nodes in closed that have at least one successor still in open

TuteeHUB · Answer

the nodes in closed that are not on the boundary are in the kernel

TuteeHUB · Answer

the number of relay nodes on each path is exactly one.

TuteeHUB · Answer

both a & b

1.	Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
A.	the boundary is defined as those nodes in closed that have at least one successor still in open
B.	the nodes in closed that are not on the boundary are in the kernel
C.	the number of relay nodes on each path is exactly one.
D.	both a & b
Answer» E.

Discussion