Coloring problem (Inspired by Exercise 6.8 in the textbook) Consider the graph with 10 nodes A_1,...
Coloring problem (Inspired by Exercise 6.8 in the textbook) Consider the graph with 10 nodes A_1, A_2, A_3, A_4, A_5, H, T, F_1, F_2, F_3. A_i is connected to A_i+1 for all i, each A_i is connected to H, H is connected to T, T is connected to each F_i, and F_i is connected to F_i+1 for all i. Draw the resulting graph. Find a 3-coloring solution for this graph by hand using the backtracking with conflict-directed back jumping strategy and the following variable order: A_1, H, A_5, F_1, T, A_4, A_3, A_2, F_3, F_2. Follow a strict value order (R, G, B). Indicate the final color (R, G, B) of each node next to the node in part (a) above. What is the final content of the conflict set for node A_2? {___________} This graph has more nodes and arcs then the one in Exercise 6.8 in the textbook and yet the solution is simpler and faster. Why? (Be objective!)