Constraint graph Binary CSP:each constraint relates at most two variables Constraint graph:nodes are variables,arcs show constraints NT WA SA NSW General-purpose CSP algorithms use the graph structure to speed up search.E.g.,Tasmania is an independent subproblem! Chapter 5 6 Constraint graph Binary CSP: each constraint relates at most two variables Constraint graph: nodes are variables, arcs show constraints Victoria WA NT SA Q NSW V T General-purpose CSP algorithms use the graph structure to speed up search. E.g., Tasmania is an independent subproblem! Chapter 5 6