Consider the following data structure representation for the following sets S1 to S4, added in DFS order:
If it was now turn to analyse S5 = {3, 4, 8, 9}. By adding this set to the data structure:A) ... the C1P would be destroyed due to having a new class but not a full extremity in the path to place it.
B) ... the C1P would hold true.
C) ... the C1P would be destroyed due to not having all full classes consecutive.
D) ... the C1P would be destroyed due to not having an empty neighbour to place an uncoloured subclass.
E) None of the above.
(Original idea by: Celso A. W. Santos)
No comments:
Post a Comment